Improved bounds on the diameter of lattice polytopes

Abstract

We show that the largest possible diameter $\delta (d,k)$ of a $d$-dimensional polytope whose vertices have integer coordinates ranging between $0$ and $k$ is at most $kd-\lceil 2d/3\rceil$ when $k\ge 3$. In addition, we show that $\delta (4,3)=8$. This substantiates the conjecture whereby $\delta (d,k)$ is at most $\lfloor (k+1)d/2\rfloor$ and is achieved by a Minkowski sum of lattice vectors.

14 pages, 1 figure

References in corpus (1)

• Improving bounds on the diameter of a polyhedron in high dimensions

Cited by in corpus (3)

• Improving bounds on the diameter of a polyhedron in high dimensions
• Elementary moves on lattice polytopes
• A note on the diameter of convex polytope