no. 6 · Monday 2 November 2026
Bounds for lattice points in terms of volume and successive minima
Abstract
We prove, in every dimension, the upper bound conjectured by Betke, Henk and Wills for the lattice-point enumerator in terms of volume and successive minima. For every convex body $K\subset R^n$ and full-rank lattice $Λ$, we establish $$ \#(K\capΛ)\le\frac{\mathrm{vol}_n(K)}{\detΛ}\prod_{i=1}^n\left(1+\frac{iλ_i}{2}\right), $$ where $λ_i$ are the successive minima of $(K-K)/2$ with respect to $Λ$. Equality holds precisely for lattice translates of positive integral dilates of unimodular simplices. We also prove $$ \#(\mathrm{int}K\capΛ)\ge\frac{\mathrm{vol}_n(K)}{\detΛ} \left(1-\frac{n}{4}\sum_{i=1}^{n-1}λ_i-\frac{n}{2}λ_n\right), $$ which implies the lower estimate with factor $1-\frac{1}{2}\sum_{i=1}^n iλ_i$. In dimension two we prove the lower bound with factor $(1-λ_1/2)(1-λ_2)$ when $λ_2\le1$. We also observe that a conjectured product lower bound for origin-symmetric bodies fails in dimension three. The proofs combine geometric compression, lattice-cell counts in coordinate sections, and an elementary coefficient comparison.
- comments
- 18 pages, 1 figure
- fields
- Metric Geometry, Combinatorics