Wills' (1981) conjecture holds if and only if the dimension is at most 4, and other miscellanea
Version 1 / Nov 16, 2026 / CC BY-SA 4.0
Abstract
Let be a lattice polytope in that is symmetric about the origin and has the origin as its only interior lattice point. In 1981 Wills conjectured that each coefficient of the Ehrhart polynomial of is at most the corresponding coefficient of the cube , that is, . Wills proved this for , and Henze showed in 2014 that it fails for every ; the dimensions , and remained open. We settle them. In dimension the conjecture holds; the new bounds are and , and, up to unimodular equivalence, only for the cube, one explicit -cell and one explicit cross-polytope. In dimension we give a polytope with vertices in whose linear Ehrhart coefficient is ; products with segments then give counterexamples in every dimension . Hence Wills' conjecture holds in if and only if . The proof in dimension combines Ehrhart reciprocity, the lower bound theorem for triangulated -spheres and an exhaustive computer enumeration of about three million sets of lattice points, listed up to symmetry. This expanded version also gives a second proof of the case in which the integer functionals bounded by on do not span , determines the second largest value of in dimension , discusses a width-two approach, describes the computer search for the counterexample, and describes all computations used in the proofs.
Provenance statement
References
- G. Averkov, C. Borger and I. Soprunov, Classification of triples of lattice polytopes with a given mixed volume , Discrete Comput. Geom. 66 (2021), no. 1, 165--202.
- G. Averkov and M. Schymura, On the maximal number of columns of a -modular integer matrix: bounds and computations , Math. Program. 206 (2024), 61--89.
- M. Beck and S. Robins, Computing the Continuous Discretely , 2nd ed., Springer, New York, 2015.
- U. Betke, M. Henk and J. M. Wills, Successive-minima-type inequalities , Discrete Comput. Geom. 9 (1993), 165--175.
- C. Bey, M. Henk and J. M. Wills, Notes on the roots of Ehrhart polynomials , Discrete Comput. Geom. 38 (2007), 81--98.
- C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph , Commun. ACM 16 (1973), no. 9, 575--577.
- E. Ehrhart, Sur les polyèdres rationnels homothétiques à dimensions , C. R. Acad. Sci. Paris 254 (1962), 616--618.
- D. Goel, Wills' (1981) conjecture holds if and only if the dimension is at most 4 , Zenodo, 2026, https://doi.org/10.5281/zenodo.23956180DOI
- P. Gritzmann and J. M. Wills, Lattice points , in: Handbook of Convex Geometry, Vol. B, North-Holland, Amsterdam, 1993, 765--797.
- C. Haase, A. Paffenholz, L. C. Piechnik and F. Santos, Existence of unimodular triangulations---positive results , Mem. Amer. Math. Soc. 270 (2021), no. 1321; arXiv:1405.1687.arXiv
Show all 22 referencesShow fewer references
- M. Henk, A. Schürmann and J. M. Wills, Ehrhart polynomials and successive minima , Mathematika 52 (2005), 1--16.
- M. Henze, On counterexamples to a conjecture of Wills and Ehrhart polynomials whose roots have equal real parts , Electron. J. Combin. 21 (1) (2014), #P1.28.
- A. M. Kasprzyk and B. Nill, Reflexive polytopes of higher index and the number , Electron. J. Combin. 19 (2012), no. 3, Paper P9.
- J. A. De Loera, R. Hemmecke, J. Tauzer and R. Yoshida, Effective lattice point counting in rational convex polytopes , J. Symbolic Comput. 38 (2004), 1273--1302.
- P. McMullen, Convex bodies which tile space by translation , Mathematika 27 (1980), 113--121.
- H. Minkowski, Geometrie der Zahlen , Teubner, Leipzig, 1896.
- H. Minkowski, Allgemeine Lehrsätze über die convexen Polyeder , Nachr. Ges. Wiss. Göttingen (1897), 198--219.
- W. Bruns, B. Ichim, C. Söger and U. von der Ohe, Normaliz. Algorithms for rational cones and affine monoids , available at https://www.normaliz.uni-osnabrueck.delink
- D. Goel, Supporting materials for ``Wills' (1981) conjecture holds if and only if the dimension is at most 4'' , GitHub repository, https://github.com/david44hello/paper_wills-1981-conjecturelink
- B. A. Venkov, On a class of Euclidean polyhedra , Vestnik Leningrad. Univ. Ser. Mat. Fiz. Him. 9 (1954), 11--31.
- D. W. Walkup, The lower bound conjecture for - and -manifolds , Acta Math. 125 (1970), 75--107.
- J. M. Wills, On an analog to Minkowski's lattice point theorem , in: The Geometric Vein (C. Davis, B. Grünbaum, F. A. Sherk, eds.), Springer, New York, 1981, 285--288.