Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Distance between vertices of lattice polytopes

  • 106 Accesses

  • 1 Citations


A lattice (d,k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers ranging between 0 and k. We consider the largest possible distance \(\delta \)(d,k) between two vertices in the edge-graph of a lattice (d,k)-polytope. We show that \(\delta \)(5,3) and \(\delta \)(3,6) are equal to 10. This substantiates the conjecture whereby \(\delta \)(d,k) is achieved by a Minkowski sum of lattice vectors.

This is a preview of subscription content, log in to check access.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Change history

  • 30 January 2020

    The erratum mostly concerns Table 4 and Figure 6 where two polytopes were misrepresented in the original version.


  1. 1.

    Acketa, D., Žunić, J.: On the maximal number of edges of convex digital polygons included into an \(m\times {m}\)-grid. J. Comb. Theory A 69, 358–368 (1995)

  2. 2.

    Balog, A., Bárány, I.: On the convex hull of the integer points in a disc. In: Proceedings of the Seventh Annual Symposium on Computational Geometry, pp. 162–165 (1991)

  3. 3.

    Barnette, D.: An upper bound for the diameter of a polytope. Discret. Math. 10, 9–13 (1974)

  4. 4.

    Chadder, N., Deza, A.: Computational determination of the largest lattice polytope diameter. Proc. IX Lat. Amer. Algorithms, Gr. Optim. Symp. Electron. Notes Discret. Math. 62, 105–110 (2017)

  5. 5.

    Del Pia, A., Michini, C.: On the diameter of lattice polytopes. Discret. Comput. Geom. 55, 681–687 (2016)

  6. 6.

    Deza, A., Manoussakis, G., Onn, S.: Primitive zonotopes. Discret. Comput. Geom. 60, 27–39 (2018)

  7. 7.

    Deza, A., Pournin, L.: Improved bounds on the diameter of lattice polytopes. Acta Math. Hung. 154, 457–469 (2018)

  8. 8.

    Deza, M., Onn, S.: Lattice-free polytopes and their diameter. Discret. Comput. Geom. 13, 59–75 (1995)

  9. 9.

    Eisenbrand, F., Hähnle, N., Razborov, A., Rothvoß, T.: Diameter of polyhedra: limits of abstraction. Math. Oper. Res. 35, 786794 (2010)

  10. 10.

    Fukuda, K.: Lecture notes: Polyhedral computation.

  11. 11.

    Kalai, G., Kleitman, D.: A quasi-polynomial bound for the diameter of graphs of polyhedra. Bull. Amer. Math. Soc. 26, 315–316 (1992)

  12. 12.

    Klee, V.K., Walkup, D.: The \(d\)-step conjecture for polyhedra of dimension \(d<6\). Acta Math. 117, 53–78 (1967)

  13. 13.

    Kleinschmidt, P., Onn, S.: On the diameter of convex polytopes. Discret. Math. 102, 75–77 (1992)

  14. 14.

    Labbé, J.P., Manneville, T., Santos, F.: Hirsch polytopes with exponentially long combinatorial segments. Math. Program. 165, 663–688 (2017)

  15. 15.

    Larman, D.: Paths on polytopes. Proc. Lond. Math. Soc. 20, 161–178 (1970)

  16. 16.

    Naddef, D.: The Hirsch conjecture is true for \((0,1)\)-polytopes. Math. Program. 45, 109–110 (1989)

  17. 17.

    Santos, F.: A counterexample to the Hirsch conjecture. Ann. Math. 176, 383–412 (2012)

  18. 18.

    Sukegawa, N.: Improving bounds on the diameter of a polyhedron in high dimensions. Discret. Math. 340, 2134–2142 (2017)

  19. 19.

    Thiele, T.: Extremalprobleme für Punktmengen. Diplomarbeit, Freie Universität Berlin (1991)

  20. 20.

    Todd, M.: An improved Kalai-Kleitman bound for the diameter of a polyhedron. SIAM J. Discret. Math. 28, 1944–1947 (2014)

  21. 21.

    Ziegler, G.: Lectures on Polytopes, Graduate Texts in Mathematics. Springer, Berlin (1995)

Download references


The authors thank the anonymous referees for their valuable comments. This work was partially supported by the Natural Sciences and Engineering Research Council of Canada Discovery Grant program (RGPIN-2015-06163), by the Exceptional Opportunity program (ESROP), and by the ANR project SoS (Structures on Surfaces) ANR-17-CE40-0033.

Author information

Correspondence to Antoine Deza.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Deza, A., Deza, A., Guan, Z. et al. Distance between vertices of lattice polytopes. Optim Lett 14, 309–326 (2020).

Download citation


  • Lattice polytope
  • Diameter
  • Minkowski sum