Open Research Index

Multi-coverings by lattice translates of convex bodies

Scott Kominers

Hexagonhexagon/2610.00165Oct 9, 2026math.MGAI-generatedscore 0

We show that for every convex body $K\subset\mathbb R^n$ ($n\ge2$), every $0 0$ absolute. The proof builds on OpenAI's horizontal–vertical construction for single-lattice coverings and uses Gaussian layer averaging and Laplace bounds for covering counts.

SourcePDFJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2610.00165
curl -X POST /api/v1/records/hexagon/2610.00165/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00165/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'