Papers › Families of lattice polytopes of mixed degree one
Families of lattice polytopes of mixed degree one
Gabriele Balletti, Christopher Borger
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
It has been shown by Soprunov that the normalized mixed volume (minus one) of an n-tuple of n-dimensional lattice polytopes is a lower bound for the number of interior lattice points in the Minkowski sum of the polytopes. He defined n-tuples of mixed degree at most one to be exactly those for which this lower bound is attained with equality, and posed the problem of a classification of such tuples. We give a finiteness result regarding this problem in general dimension n ≥4, showing that all but finitely many n-tuples of mixed degree at most one admit a common lattice projection onto the unimodular simplex Δₙ₋₁. Furthermore, we give a complete solution in dimension n=3. In the course of this we show that our finiteness result does not extend to dimension n=3, as we describe infinite families of triples of mixed degree one not admitting a common lattice projection onto the unimodular triangle Δ₂.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections