Projecting lattice polytopes without interior lattice points

DOI10.1287/MOOR.1110.0503MaRDI QIDQ2884283zbMATH OpenOpenAlexFDO

Authors Benjamin Nill, Günter M. Ziegler

Publication date 24 May 2012

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1101.4292

zbMATH Keywords

interior pointslattice polytopeslattice projectionslattice-free convex bodies

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)

Abstract: We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d-1)-dimensional lattice polytope without interior lattice points. This was conjectured by Treutlein. As an immediate corollary, we get a short proof of a recent result of Averkov, Wagner and Weismantel, namely the finiteness of the number of maximal lattice polytopes without interior lattice points. Moreover, we show that in dimension four and higher some of these finitely many polytopes are not maximal as convex bodies without interior lattice points.

Recommendations

• Multiples of lattice polytopes without interior lattice points
• Integral body-building in \({\mathbb{R}}^ 3\)
• Families of lattice polytopes of mixed degree one
• Lattice 3-polytopes with few lattice points
• On the volume and projection of convex sets containing no lattice points

Cited in

(23)

• Lattice 3-polytopes with six lattice points
• Lattice 3-polytopes with few lattice points
• On finitely generated closures in the theory of cutting planes
• Difference between families of weakly and strongly maximal integral lattice-free polytopes
• Complexity of linear relaxations in integer programming
• Canonical threefold singularities with a torus action of complexity one and \(k\)-empty polytopes
• Elementary moves on lattice polytopes
• Families of lattice polytopes of mixed degree one
• The mixed degree of families of lattice polytopes
• Largest integral simplices with one interior integral point: solution of Hensley's conjecture and related results
• About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
• The finiteness threshold width of lattice polytopes
• Smoothing Calabi-Yau toric hypersurfaces using the Gross-Siebert algorithm
• The diameter of lattice zonotopes
• Multiples of lattice polytopes without interior lattice points
• Relaxations of mixed integer sets from lattice-free polyhedra
• Relaxations of mixed integer sets from lattice-free polyhedra
• Primitive point packing
• Lattice zonotopes of degree 2
• Non-projectability of polytope skeleta
• Projecting lattice polytopes according to the minimal model program
• A classification of \(n\)-representation infinite algebras of type \(\tilde{A}\)
• Cracked polytopes and Fano toric complete intersections

Describes a project that uses

Uses Software

• polymake

This page was built for publication: Projecting lattice polytopes without interior lattice points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884283)