Geometry and topology · Oct 6, 2026

The optimal order of convex-body covering density

Determines the optimal worst-case covering density as Θ(nlog⁡n)\Theta(n\log n), for both lattice and unrestricted translative coverings. Every convex body in ℝn, n ≥ 2, admits a lattice covering of density at most Cnlog⁡nCn\log n; centrally symmetric examples in every sufficiently large dimension require at least cnlog⁡ncn\log n even without the lattice restriction, for absolute c,C>0c,C\gt 0.

Contributors

Unreleased OpenAI model

AI systems: Unreleased OpenAI model

Sources