Wills' (1981) conjecture holds if and only if the dimension is at most 4, and other miscellanea

A mix of human-written and AI-generated textHuman understanding: some partsmath.CO — Combinatoricsmath.MG — Metric Geometry

Contributed by Dave Goel ↗

Version 1 / Nov 16, 2026 / CC BY-SA 4.0

Abstract

Let PP be a lattice polytope in Rn\mathbb R^n that is symmetric about the origin and has the origin as its only interior lattice point. In 1981 Wills conjectured that each coefficient gi(P)g_i(P) of the Ehrhart polynomial of PP is at most the corresponding coefficient of the cube [−1,1]n[-1,1]^n, that is, gi(P)≤2i(ni)g_i(P)\le 2^i\binom ni. Wills proved this for n≤3n\le3, and Henze showed in 2014 that it fails for every n≥7n\ge7; the dimensions 44, 55 and 66 remained open. We settle them. In dimension 44 the conjecture holds; the new bounds are g1(P)≤8g_1(P)\le8 and g2(P)≤24g_2(P)\le24, and, up to unimodular equivalence, g1(P)=8g_1(P)=8 only for the cube, one explicit 2424-cell and one explicit cross-polytope. In dimension 55 we give a polytope with 5050 vertices in [−1,1]5[-1,1]^5 whose linear Ehrhart coefficient is 101/10>10101/10>10; products with segments then give counterexamples in every dimension n≥6n\ge6. Hence Wills' conjecture holds in Rn\mathbb R^n if and only if n≤4n\le4. The proof in dimension 44 combines Ehrhart reciprocity, the lower bound theorem for triangulated 33-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 11 on PP do not span R4\mathbb R^4, determines the second largest value of g2g_2 in dimension 44, discusses a width-two approach, describes the computer search for the counterexample, and describes all computations used in the proofs.

Author comments: First version: November 3, 2026. This is the expanded version of the paper "Wills' (1981) conjecture holds if and only if the dimension is at most 4", which is at https://hexagonmath.org/2611.00540 on Hexagon.

Provenance statement

This work was done overwhelmingly by AI models, steered by the author in a continuous critical dialogue, alternating between Anthropic's Claude and OpenAI's ChatGPT. The author takes full responsibility for the paper.

References

  1. 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.
  2. G. Averkov and M. Schymura, On the maximal number of columns of a Δ\Delta-modular integer matrix: bounds and computations , Math. Program. 206 (2024), 61--89.
  3. M. Beck and S. Robins, Computing the Continuous Discretely , 2nd ed., Springer, New York, 2015.
  4. U. Betke, M. Henk and J. M. Wills, Successive-minima-type inequalities , Discrete Comput. Geom. 9 (1993), 165--175.
  5. C. Bey, M. Henk and J. M. Wills, Notes on the roots of Ehrhart polynomials , Discrete Comput. Geom. 38 (2007), 81--98.
  6. C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph , Commun. ACM 16 (1973), no. 9, 575--577.
  7. E. Ehrhart, Sur les polyèdres rationnels homothétiques à nn dimensions , C. R. Acad. Sci. Paris 254 (1962), 616--618.
  8. 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
  9. P. Gritzmann and J. M. Wills, Lattice points , in: Handbook of Convex Geometry, Vol. B, North-Holland, Amsterdam, 1993, 765--797.
  10. 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
  1. M. Henk, A. Schürmann and J. M. Wills, Ehrhart polynomials and successive minima , Mathematika 52 (2005), 1--16.
  2. 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.
  3. A. M. Kasprzyk and B. Nill, Reflexive polytopes of higher index and the number 1212 , Electron. J. Combin. 19 (2012), no. 3, Paper P9.
  4. 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.
  5. P. McMullen, Convex bodies which tile space by translation , Mathematika 27 (1980), 113--121.
  6. H. Minkowski, Geometrie der Zahlen , Teubner, Leipzig, 1896.
  7. H. Minkowski, Allgemeine Lehrsätze über die convexen Polyeder , Nachr. Ges. Wiss. Göttingen (1897), 198--219.
  8. 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
  9. 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
  10. B. A. Venkov, On a class of Euclidean polyhedra , Vestnik Leningrad. Univ. Ser. Mat. Fiz. Him. 9 (1954), 11--31.
  11. D. W. Walkup, The lower bound conjecture for 33- and 44-manifolds , Acta Math. 125 (1970), 75--107.
  12. 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.

Version history

  1. v1 · 26 pagesSubmitted by Dave GoelFirst version: November 3, 2026. This is the expanded version of the paper "Wills' (1981) conjecture holds if and only if the dimension is at most 4", which is at https://hexagonmath.org/2611.00540 on Hexagon.CurrentNov 16, 2026