Preprint in the OpenAI Math release
A single-lattice covering bound of order n log n
OpenAI
Abstract
Every convex body in ℝ, 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.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.