Lattice 3-polytopes with few lattice points

DOI10.1137/15M1014450zbMath1341.52023arXiv1409.6701OpenAlexW4237179050MaRDI QIDQ161310

Mónica Blanco Gómez, Francisco Santos, Mónica Blanco

Publication date: 23 September 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Abstract: We extend White's classification of empty tetrahedra to the complete classification of lattice $3$-polytopes with five lattice points, showing that, apart from infinitely many of width one, there are exactly nine equivalence classes of them with width two and none of larger width. We also prove that, for each $nin mathbb{N}$, there is only a finite number of (classes of) lattice $3$-polytopes with $n$ lattice points and of width larger than one. This implies that extending the present classification to larger sizes makes sense, which is the topic of subsequent papers of ours.

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

zbMATH Keywords

finitenesslattice pointsunimodular equivalencelattice 3-polytopes

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Cites Work

• Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
• Lattice 3-polytopes with six lattice points
• Triangulations. Structures for algorithms and applications
• Lattice vertex polytopes with interior lattice points
• Lattice polytopes with distinct pair-sums
• Minkowski length of 3D lattice polytopes
• Toric Fano three-folds with terminal singularities
• Projecting Lattice Polytopes Without Interior Lattice Points
• Unimodular triangulations of dilated 3-polytopes
• On the classification of convex lattice polytopes
• The finiteness threshold width of lattice polytopes
• Integral Polyhedra in Three Space
• Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
• Lattice Tetrahedra

Related Items (18)

The fiber dimension of a graph ⋮ Complexity of linear relaxations in integer programming ⋮ Lattice zonotopes of degree 2 ⋮ Towards tropically counting binodal surfaces ⋮ Enumerating lattice 3-polytopes ⋮ The complete classification of empty lattice 4-simplices ⋮ Classification of triples of lattice polytopes with a given mixed volume ⋮ Gorenstein polytopes with trinomial \(h^*\)-polynomials ⋮ The finiteness threshold width of lattice polytopes ⋮ The mixed degree of families of lattice polytopes ⋮ Order-chain polytopes ⋮ Enumeration of lattice 3-polytopes by their number of lattice points ⋮ Lattice 3-polytopes with six lattice points ⋮ Non-spanning lattice 3-polytopes ⋮ Enumeration of lattice polytopes by their volume ⋮ Polytopes.Lattice.FewLatticePoints3D ⋮ Lattice distances in 3-dimensional quantum jumps ⋮ The characterisation problem of Ehrhart polynomials of lattice polytopes

This page was built for publication: Lattice 3-polytopes with few lattice points