Publication:161308

DOI10.48550/ARXIV.1601.02577zbMath1401.52023arXiv1601.02577OpenAlexW2753535706MaRDI QIDQ161308

Mónica Blanco

Publication date: 11 January 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most eleven lattice points (there are 216,453 of them). In order to achieve this we prove that if $P$ is a lattice 3-polytope of width larger than one and with at least seven lattice points then it fits in one of three categories that we call boxed, spiked and merged. Boxed polytopes have at most 11 lattice points; in particular they are finitely many, and we enumerate them completely with computer help. Spiked polytopes are infinitely many but admit a quite precise description (and enumeration). Merged polytopes are computed as a union (merging) of two polytopes of width larger than one and strictly smaller number of lattice points.

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

zbMATH Keywords

finitenesslattice pointslattice polytopesunimodular equivalencelattice width

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Lattice 3-polytopes with six lattice points
• Lattice 3-polytopes with few lattice points
• Quantum jumps of normal polytopes
• Lattice polytopes with distinct pair-sums
• Minkowski length of 3D lattice polytopes
• Canonical Toric Fano Threefolds
• Polytopes, Rings, and K-Theory
• Integral Polyhedra in Three Space
• Lectures on Polytopes
• Toric Surface Codes and Minkowski Length of Polygons
• Lattice Tetrahedra

Related Items (12)

$\mathbb{F}_q$-Zeros of Sparse Trivariate Polynomials and Toric 3-Fold Codes ⋮ Generalized flatness constants, spanning lattice polytopes, and the Gromov width ⋮ The diameter of lattice zonotopes ⋮ Towards tropically counting binodal surfaces ⋮ Classification of triples of lattice polytopes with a given mixed volume ⋮ Elementary moves on lattice polytopes ⋮ The finiteness threshold width of lattice polytopes ⋮ 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: Enumeration of lattice 3-polytopes by their number of lattice points