{"id":"openai-math/A-single-lattice-covering-bound-of-order-n-log-n","pdf":"https://github.com/openai/math/blob/main/preprints/A-single-lattice-covering-bound-of-order-n-log-n-September-23-2026/paper.pdf","url":"https://github.com/openai/math/tree/main/preprints/A-single-lattice-covering-bound-of-order-n-log-n-September-23-2026","tags":["convex-geometry","lattice-covering","geometry"],"score":0,"title":"A single-lattice covering bound of order n log n","domain":"Convex and metric geometry","family":"092","origin":"ai-generated","source":"openai-math","authors":["OpenAI"],"reviews":0,"subject":"math.MG","summary":"Every convex body in ℝ n , n ≥ 2, admits a covering by translates along one full-rank lattice with density at most $`Cn\\log n`$, for an absolute constant C . No symmetry or boundary regularity is assumed.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":1,"published":"2026-09-23","reactions":{},"discussion":[{"url":"https://gilkalai.wordpress.com/2026/10/07/updates-sharing-ai-progress-on-mathematics-amazing-and-my-lecture-plans/#:~:text=OpenAI%20announces%20a%20universal%20lattice-covering%20bound","date":"2026-10-07","kind":"web","site":"Combinatorics and more","text":"OpenAI announces a universal lattice-covering bound and matching examples even for unrestricted translative coverings , determining the worst-case order over convex bodies. Distinct distances and unit distances. These problems featured in János Pach’s guest post on Guth and Katz and in my earlier…","added":"2026-10-24","title":"Updates: Sharing AI progress on mathematics (amazing!); and my lecture plans"}],"formalized":true,"family_title":"The optimal order of convex-body covering density"}