A single-lattice covering bound of order n log n
AI contributions · unreleased internal OpenAI modelView details
Ancillary data · Formal proof, 5 proof or workflow linksView
Abstract — v1
Every convex body in ℝn, n ≥ 2, admits a covering by translates along one full-rank lattice with density at most , for an absolute constant C. No symmetry or boundary regularity is assumed.
Review conversation
No reviews from the Hub API for this paper.