Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 75 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 104 tok/s Pro
Kimi K2 170 tok/s Pro
GPT OSS 120B 468 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

On lattice coverings by locally anti-blocking bodies and polytopes with few vertices (2505.07369v2)

Published 12 May 2025 in math.MG

Abstract: In 2021, Ordentlich, Regev and Weiss made a breakthrough that the lattice covering density of any $n$-dimensional convex body is upper bounded by $cn{2}$, improving on the best previous bound established by Rogers in 1959. However, for the Euclidean ball, Rogers obtained the better upper bound $n(\log_{e}n){c}$, and this result was extended to certain symmetric convex bodies by Gritzmann. The constant $c$ above is independent on $n$. In this paper, we show that such a bound can be achieved for more general classes of convex bodies without symmetry, including anti-blocking bodies, locally anti-blocking bodies and $n$-dimensional polytopes with $n+2$ vertices.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.