On the diameter of lattice polytopes (Q282757): Difference between revisions

Let \(P\) be a polytope and let \(G\) be its 1-skeleton. The distance between two vertices of \(G\) is the minimal possible number of edges for broken lines in \(G\) with endpoints in these two vertices. The diameter of \(G\) is the maximal distance between two vertices in \(G\). In this paper the authors show that the diameter of a \(d\)-dimensional lattice polytope in \([0,k]^n\) is at most \(\lfloor (k-12)d\rfloor\). In particular this result implies that the diameter of a \(d\)-dimensional half-integral polytope is at most \(\lfloor \frac32 d\rfloor\). In addition the authors show the tightness of this bound for half-integral polytopes for every \(d\).