The diameter of lattice zonotopes

DOI10.1090/PROC/14977zbMATH Open1443.52011arXiv1905.04750OpenAlexW3006757395MaRDI QIDQ5113413FDOQ5113413

Lionel Pournin, Noriyoshi Sukegawa, Antoine Deza

Publication date: 11 June 2020

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Abstract: We establish sharp asymptotic estimates for the diameter of primitive zonotopes when their dimension is fixed. We also prove that, for infinitely many integers $k$, the largest possible diameter of a lattice zonotope contained in the hypercube $[0,k{]}^d$ is uniquely achieved by a primitive zonotope. As a consequence, we obtain that this largest diameter grows like $k^{d/(d+1)}$ up to an explicit multiplicative constant, when $d$ is fixed and $k$ goes to infinity, providing a new lower bound on the largest possible diameter of a lattice polytope contained in $[0,k{]}^d$.

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

Recommendations

• Improved bounds on the diameter of lattice polytopes
• Small primitive zonotopes
• On the diameter of lattice polytopes
• Primitive zonotopes
• Computational determination of the largest lattice polytope diameter

zbMATH Keywords

diameterprimitive zonotopelattice zonotope

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Distance in graphs (05C12) Lattices and convex bodies (number-theoretic aspects) (11H06)

Cites Work

• Enumeration of lattice 3-polytopes by their number of lattice points
• Non-spanning lattice 3-polytopes
• Projecting lattice polytopes without interior lattice points
• Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
• Lectures on Polytopes
• Computing the Continuous Discretely
• Title not available (Why is that?)
• On the diameter of convex polytopes
• The Hirsch conjecture is true for (0,1)-polytopes
• On the diameter of lattice polytopes
• Diameter, Decomposability, and Minkowski Sums of Polytopes
• Lattice points in simple polytopes
• On the probability that \(k\) positive integers are relatively prime
• Title not available (Why is that?)
• A counterexample to the Hirsch conjecture
• A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
• A quasi-polynomial bound for the diameter\\of graphs of polyhedra
• On maximal convex lattice polygons inscribed in a plane convex set
• The convex hull of the integer points in a large ball
• On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
• On the width of lattice-free simplices
• Improved bounds on the diameter of lattice polytopes
• Improving bounds on the diameter of a polyhedron in high dimensions
• An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron
• Primitive zonotopes
• On the number of lattice free polytopes
• An asymptotically improved upper bound on the diameter of polyhedra
• Counting problems relating to a theorem of Dirichlet
• Classification of empty lattice 4-simplices of width larger than two
• Primitive Points in Rational Polygons

Cited In (7)

• Computational determination of the largest lattice polytope diameter
• Short simplex paths in lattice polytopes
• Primitive point packing
• Monotone diameter of bisubmodular polyhedra
• Isoperimetric problems for zonotopes
• A Generalized Simplex Method for Integer Problems Given by Verification Oracles
• The complexity of geometric scaling

This page was built for publication: The diameter of lattice zonotopes

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