arXiv Analytics

Sign in

arXiv:0903.4842 [math.MG]AbstractReferencesReviewsResources

Covering convex bodies by cylinders and lattice points by flats

Karoly Bezdek, Alexander Litvak

Published 2009-03-27Version 1

In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an application we establish lower bounds on the number of k-dimensional flats (i.e. translates of k-dimensional linear subspaces) needed to cover all the integer points of a given convex body in d-dimensional Euclidean space for 0<k<d.

Related articles: Most relevant | Search more
arXiv:1507.05115 [math.MG] (Published 2015-07-17)
Packing convex bodies by cylinders
arXiv:1308.0791 [math.MG] (Published 2013-08-04)
Illuminating and covering convex bodies
arXiv:1707.00682 [math.MG] (Published 2017-07-01)
Stretching convex domains to capture many lattice points