Upper Bounds on Covering Minima of Convex Bodies
Abstract
We give two new upper bounds on the covering minima of convex bodies, depending on covering minima of certain projections and intersections with linear subspaces. We show one bound to be sharp for direct sums of two convex bodies, generalizing previous results on the covering radius and lattice width of direct sums. We apply our results to standard terminal simplices, reducing the gap between the upper and lower bounds in a conjecture of Gonzal\'ez Merino and Schymura (2017), which gives insight on a conjecture of Codenotti, Santos and Schymura (2021) on the maximal covering radius of a non-hollow lattice polytope.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.