Codenotti–Santos–Schymura conjecture on covering radii of non-hollow lattice polytopes

From papers

Let PRdP\subseteq \mathbb{R}^d be a non-hollow lattice polytope. A full-dimensional lattice polytope is called terminal if it is a direct sum of translates of terminal simplices, where the terminal simplex is Td=conv(1d,e1,,ed)T_d=\operatorname{conv}(-\mathbb{1}_d,e_1,\dots,e_d). Codenotti–Santos–Schymura conjecture. The covering radius satisfies

μ(P)d2,\mu(P)\leqslant \frac{d}{2},

with equality if and only if PP is a terminal dd-polytope up to a unimodular transformation. Codenotti, Santos and Schymura pose this as the problem of determining the maximal covering radius of a non-hollow lattice polytope and prove the conjecture in dimensions at most 33; the general case remains open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Katarina Krivokuća, “Upper Bounds on Covering Minima of Convex Bodies”, arXiv:2601.15173 (2026).

Solutions 0

No solutions have been posted yet.