Betke-Henk-Wills conjecture on lattice point enumerators

About 24 years old · traced to

Let K0d\mathcal{K}^d_0 be the set of oo-symmetric convex bodies in Rd\mathbb{R}^d, let Ld\mathcal{L}^d be the space of full-rank lattices, and for K∈K0dK\in\mathcal{K}^d_0 and Λ∈Ld\Lambda\in\mathcal{L}^d let

G(K,Λ)=∣K∩Λ∣,G(K,\Lambda)=|K\cap\Lambda|,

with successive minima

λi(K,Λ)=inf⁡{λ>0:dim⁡(λK∩Λ)≥i},1≤i≤d.\lambda_i(K,\Lambda)=\inf\{\lambda>0:\dim(\lambda K\cap\Lambda)\geq i\},\qquad 1\leq i\leq d.

Betke-Henk-Wills conjecture. For any K∈K0dK\in\mathcal{K}^d_0 and Λ∈Ld\Lambda\in\mathcal{L}^d,

G(K,Λ)≤∏i=1d⌊2λi(K,Λ)+1⌋.G(K,\Lambda)\leq\prod_{i=1}^d\left\lfloor\frac{2}{\lambda_i(K,\Lambda)}+1\right\rfloor.

The conjecture is a discrete analogue of Minkowski's Second Theorem, seeking to bound the global lattice point count using the successive minima. It is established for orthogonal parallelotopes but remains unresolved for d≥5d\geq5 and general convex bodies.

References

Primary source

Chao Wang, “Local Stability and Quantitative Bounds for the Betke-Henk-Wills Conjecture”, arXiv:2603.00007 (2026).

Additional references

6 papers in this index state this conjecture (2002–2026). The statement above is taken from the most recent of them; the others are arXiv:2602.06662, arXiv:2304.00120, arXiv:2105.13090, arXiv:2005.02234, arXiv:math/0204158.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.