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

Let P be a lattice polytope in ℝ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) of the Ehrhart polynomial of P is at most the corresponding coefficient of the cube [−1,1]n, that is, gi(P) ≤ 2i·(n choose i). Wills proved this for n ≤ 3, and Henze showed in 2014 that it fails for every n ≥ 7; the dimensions 4, 5 and 6 remained open. We settle them. In dimension 4 the conjecture holds; the new bounds are g1(P) ≤ 8 and g2(P) ≤ 24, and, up to unimodular equivalence, g1(P) = 8 only for the cube, one explicit 24-cell and one explicit cross-polytope. In dimension 5 we give a polytope with 50 vertices in [−1,1]5 whose linear Ehrhart coefficient is 101/10 > 10; products with segments then give counterexamples in every dimension n ≥ 6. Hence Wills' conjecture holds in ℝn if and only if n ≤ 4. The proof in dimension 4 combines Ehrhart reciprocity, the lower bound theorem for triangulated 3-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 1 on P do not span ℝ4, determines the second largest value of g2 in dimension 4, discusses a width-two approach, describes the computer search for the counterexample, and describes all computations used in the proofs.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.23955454
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

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

Dave Goel
3 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

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

Dave Goel
preprint en

Abstract

Let P be a lattice polytope in ℝ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) of the Ehrhart polynomial of P is at most the corresponding coefficient of the cube [−1,1]n, that is, gi(P) ≤ 2i·(n choose i). Wills proved this for n ≤ 3, and Henze showed in 2014 that it fails for every n ≥ 7; the dimensions 4, 5 and 6 remained open. We settle them. In dimension 4 the conjecture holds; the new bounds are g1(P) ≤ 8 and g2(P) ≤ 24, and, up to unimodular equivalence, g1(P) = 8 only for the cube, one explicit 24-cell and one explicit cross-polytope. In dimension 5 we give a polytope with 50 vertices in [−1,1]5 whose linear Ehrhart coefficient is 101/10 > 10; products with segments then give counterexamples in every dimension n ≥ 6. Hence Wills' conjecture holds in ℝn if and only if n ≤ 4. The proof in dimension 4 combines Ehrhart reciprocity, the lower bound theorem for triangulated 3-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 1 on P do not span ℝ4, determines the second largest value of g2 in dimension 4, discusses a width-two approach, describes the computer search for the counterexample, and describes all computations used in the proofs.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon