The first two coefficients in Wills' lattice point inequality

For a convex body K ⊂ ℝⁿ let G(K) be the number of integer points in K, and let V₀(K), …, Vₙ(K) be its intrinsic volumes. Wills conjectured in 1973 that G(K) ≤ V₀(K) + ⋯ + Vₙ(K). This holds for n ≤ 3 but fails in high dimensions, and Henk asked whether at least the coefficients of Vₙ and Vₙ₋₁ are correct. We show that they are: for every n there is a constant Cₙ such that G(K) ≤ Vₙ(K) + Vₙ₋₁(K) + Cₙ(V₀(K) + ⋯ + Vₙ₋₂(K)) for all convex bodies K ⊂ ℝⁿ. The proof is an induction on the dimension, slicing by the hyperplanes xₙ = k. Its main step bounds the error of the Riemann sum of the slice volumes of a polytope whose vertices have integral heights. The bound comes from an exact decomposition of this error into contributions of facets and of faces of codimension two.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-30
DOI
https://doi.org/10.5281/zenodo.23821139
Primary Topic
Point processes and geometric inequalities
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

The first two coefficients in Wills' lattice point inequality

Adam Henriksson
Zenodo (CERN European Organization for Nuclear Research)
Point processes and geometric inequalities
preprint

The first two coefficients in Wills' lattice point inequality

Adam Henriksson
preprint en

Abstract

For a convex body K ⊂ ℝⁿ let G(K) be the number of integer points in K, and let V₀(K), …, Vₙ(K) be its intrinsic volumes. Wills conjectured in 1973 that G(K) ≤ V₀(K) + ⋯ + Vₙ(K). This holds for n ≤ 3 but fails in high dimensions, and Henk asked whether at least the coefficients of Vₙ and Vₙ₋₁ are correct. We show that they are: for every n there is a constant Cₙ such that G(K) ≤ Vₙ(K) + Vₙ₋₁(K) + Cₙ(V₀(K) + ⋯ + Vₙ₋₂(K)) for all convex bodies K ⊂ ℝⁿ. The proof is an induction on the dimension, slicing by the hyperplanes xₙ = k. Its main step bounds the error of the Riemann sum of the slice volumes of a polytope whose vertices have integral heights. The bound comes from an exact decomposition of this error into contributions of facets and of faces of codimension two.

Zenodo (CERN European Organization for Nuclear Research)
Point processes and geometric inequalities
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