Improved bounds on the diameter of lattice polytopes (Q1747971)

A lattice \((d,k)\)-polytope is the convex hull of a set of points with integer coordinates whose vertices are in the set \(\{0,1,\ldots, k\}^d\). The authors study the largest possible diameter of a lattice \((d,k)\)-polytope, \(\delta (d,k)\), and show that, for \(k \geq 3\), it is at most \(kd - [2d/3]-(k-3)\). The result is consistent with the value of \([(k+1)d/2]\) conjectured by the first author et al. [Discrete Comput. Geom. 60, No. 1, 27--39 (2018; Zbl 1406.52029)]. In this direction, it is shown here that \(\delta (4,3)=8\).