The diameter of lattice zonotopes

DOI10.1090/PROC/14977MaRDI QIDQ5113413zbMATHOpenAlexFDO

Authors Antoine Deza, Lionel Pournin, Noriyoshi Sukegawa

Publication date 11 June 2020

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

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

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)

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$.

Recommendations

• Improved bounds on the diameter of lattice polytopes
• Small primitive zonotopes
• On the diameter of lattice polytopes
• Primitive zonotopes

Cites work

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

Cited in

(10)

• Belt distance between facets of space-filling zonotopes
• The vertices of primitive zonotopes
• Monotone diameter of bisubmodular polyhedra
• Short simplex paths in lattice polytopes
• Belt diameter of \(\varPi\)-zonotopes
• Isoperimetric problems for zonotopes
• A generalized simplex method for integer problems given by verification oracles
• Primitive zonotopes
• The complexity of geometric scaling
• Primitive point packing

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)