Small Primitive Zonotopes

  • Antoine Deza
  • George Manoussakis
  • Shmuel Onn
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 234)


We study a family of lattice polytopes, called primitive zonotopes, describe instances with small parameters, and discuss connections to the largest diameter of lattice polytopes and to the computational complexity of multicriteria matroid optimization. Complexity results and open questions are also presented.


Lattice polytopes Primitive integer vectors Matroid optimization Diameter 



The authors thank the anonymous referees, Johanne Cohen, Nathann Cohen, Komei Fukuda, and Aladin Virmaux for valuable comments and for informing us of reference [31], Emo Welzl and Günter Ziegler for helping us access Thorsten Thiele’s Diplomarbeit, Dmitrii Pasechnik for pointing out reference [29], and Vincent Pilaud for pointing out that \(Z_1(d,2)\) is the permutahedron of type \(B_d\). This work was partially supported by the Natural Sciences and Engineering Research Council of Canada Discovery Grant program (RGPIN-2015-06163), by the Digiteo Chair C&O program at Université de Paris Sud, and by the Dresner Chair at the Technion.


  1. 1.
    D. Acketa, J. Žunić, 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)MathSciNetCrossRefGoogle Scholar
  2. 2.
    X. Allamigeon, P. Benchimol, S. Gaubert, M. Joswig, Log-barrier interior point methods are not strongly polynomial. SIAM J. Appl. Algebra Geom. 2, 140–178 (2018)MathSciNetCrossRefGoogle Scholar
  3. 3.
    A. Balog, I. Bárány, On the convex hull of the integer points in a disc, in Proceedings of the Seventh Annual Symposium on Computational Geometry (1991), pp. 162–165Google Scholar
  4. 4.
    S. Borgwardt, J. De Loera, E. Finhold. The diameters of transportation polytopes satisfy the Hirsch conjecture. Mathematical Programming, (to appear)Google Scholar
  5. 5.
    N. Chadder, A. Deza, Computational determination of the largest lattice polytope diameter. Electron. Notes Discrete Math. 62, 105–110 (2017)MathSciNetCrossRefGoogle Scholar
  6. 6.
    C. Colbourn, W. Kocay, D. Stinson, Some NP-complete problems for hypergraph degree sequences. Discrete Appl. Math. 14, 239–254 (1986)MathSciNetCrossRefGoogle Scholar
  7. 7.
    A. Del Pia, C. Michini, On the diameter of lattice polytopes. Discrete Comput. Geom. 55, 681–687 (2016)MathSciNetCrossRefGoogle Scholar
  8. 8.
    A. Deza, A. Deza, Z. Guan, L. Pournin, Distance between vertices of lattice polytopes. AdvOL Report 2018/1, McMaster University, 2018Google Scholar
  9. 9.
    A. Deza, A. Levin, S.M. Meesum, S. Onn, Optimization over degree sequence. arXiv:1706.03951, 2017
  10. 10.
    A. Deza, G. Manoussakis, S. Onn, Primitive zonotopes. Discrete Comput. Geom. 60, 27–39 (2018)MathSciNetCrossRefGoogle Scholar
  11. 11.
    A. Deza, L. Pournin, Improved bounds on the diameter of lattice polytopes. Acta Mathematica Hungarica, 154, 457–469 (2018)MathSciNetCrossRefGoogle Scholar
  12. 12.
    D. Eppstein, Zonohedra and zonotopes. Math. Educ. Res. 5, 15–21 (1996)Google Scholar
  13. 13.
    P. Erdős, T. Gallai, Graphs with prescribed degrees of vertices (in Hungarian). Matematikai Lopak 11, 264–274 (1960)zbMATHGoogle Scholar
  14. 14.
    K. Fukuda, Lecture notes: Polyhedral computation.
  15. 15.
    M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1993)CrossRefGoogle Scholar
  16. 16.
    B. Grünbaum, Convex Polytopes (Springer, Graduate Texts in Mathematics, Berlin, 2003)CrossRefGoogle Scholar
  17. 17.
    J. Humphreys, Reflection Groups and Coxeter Groups (Cambridge University Press, Cambridge Studies in Advanced Mathematics, Cambridge, 1990)CrossRefGoogle Scholar
  18. 18.
    G. Kalai, D. Kleitman, A quasi-polynomial bound for the diameter of graphs of polyhedra. Bull. Am. Math. Soc. 26, 315–316 (1992)MathSciNetCrossRefGoogle Scholar
  19. 19.
    P. Kleinschmidt, S. Onn, On the diameter of convex polytopes. Discrete Math. 102, 75–77 (1992)MathSciNetCrossRefGoogle Scholar
  20. 20.
    C. Klivans, V. Reiner, Shifted set families, degree sequences, and plethysm. Electron. J. Comb. 15 (2008)Google Scholar
  21. 21.
    R. Liu, Nonconvexity of the set of hypergraph degree sequences. Electron. J. Comb. 20(1) (2013)Google Scholar
  22. 22.
    M. Melamed, S. Onn, Convex integer optimization by constantly many linear counterparts. Linear Algebra Its Appl. 447, 88–109 (2014)MathSciNetCrossRefGoogle Scholar
  23. 23.
    N.L.B. Murthy, M.K. Srinivasan, The polytope of degree sequences of hypergraphs. Linear Algebra Its Appl. 350, 147–170 (2002)MathSciNetCrossRefGoogle Scholar
  24. 24.
    D. Naddef, The Hirsch conjecture is true for \((0,1)\)-polytopes. Math. Program. 45, 109–110 (1989)Google Scholar
  25. 25.
    S. Onn, Nonlinear Discrete Optimization. (European Mathematical Society, Zurich Lectures in Advanced Mathematics, 2010)Google Scholar
  26. 26.
    S. Onn, U.G. Rothblum, Convex combinatorial optimization. Discrete Comput. Geom. 32, 549–566 (2004)MathSciNetCrossRefGoogle Scholar
  27. 27.
    F. Santos, A counterexample to the Hirsch conjecture. Ann. Math. 176, 383–412 (2012)MathSciNetCrossRefGoogle Scholar
  28. 28.
    N. Sloane (ed.), The on-line encyclopedia of integer sequences.
  29. 29.
    I. Soprunov, J. Soprunova, Eventual quasi-linearity of the Minkowski length. Eur. J. Comb. 58, 110–117 (2016)MathSciNetCrossRefGoogle Scholar
  30. 30.
    N. Sukegawa, Improving bounds on the diameter of a polyhedron in high dimensions. Discrete Math. 340, 2134–2142 (2017)MathSciNetCrossRefGoogle Scholar
  31. 31.
    T. Thiele, Extremalprobleme für Punktmengen (Diplomarbeit, Freie Universität Berlin, 1991)Google Scholar
  32. 32.
    M. Todd, An improved Kalai-Kleitman bound for the diameter of a polyhedron. SIAM J. Discrete Math. 28, 1944–1947 (2014)MathSciNetCrossRefGoogle Scholar
  33. 33.
    G. Ziegler, Lectures on Polytopes (Springer, Graduate Texts in Mathematics, Berlin, 1995)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Advanced Optimization Laboratory, Faculty of EngineeringMcMaster UniversityHamiltonCanada
  2. 2.Laboratoire de Recherche en InformatiqueCNRS – Université de Paris SudOrsayFrance
  3. 3.Operations Research, Davidson faculty of IE & MTechnion - Israel Institute of TechnologyHaifaIsrael

Personalised recommendations