Preprint in the OpenAI Math release
Translative covering densities of order n log n
OpenAI
Abstract
For every sufficiently large dimension n, we construct a centrally symmetric convex body whose translative covering density exceeds , where c > 0 is absolute. This disproves the existence of a universal linear upper bound and matches the order of Rogers' upper bound.
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.