Computational determination of the largest lattice polytope diameter

DOI10.1016/j.dam.2019.10.026zbMath1443.52010arXiv1704.01687OpenAlexW2986348262WikidataQ126865503 ScholiaQ126865503MaRDI QIDQ5918843

Antoine Deza, Nathan Chadder

Publication date: 29 May 2020

Published in: Discrete Applied Mathematics, Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

lattice polytopeslattice polytopeenumeration algorithmedge-graph diameter

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Enumeration in graph theory (05C30) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Other problems of combinatorial convexity (52A37)

Related Items (2)

Distance between vertices of lattice polytopes ⋮ Improved bounds on the diameter of lattice polytopes

Cites Work

• Unnamed Item
• On the diameter of lattice polytopes
• Primitive zonotopes
• On the diameter of convex polytopes
• On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
• Improved bounds on the diameter of lattice polytopes
• The Hirsch conjecture is true for (0,1)-polytopes
• Distance between vertices of lattice polytopes
• Diameter, Decomposability, and Minkowski Sums of Polytopes

This page was built for publication: Computational determination of the largest lattice polytope diameter