arXiv Analytics

Sign in

arXiv:2111.07323 [math.MG]AbstractReferencesReviewsResources

Covering functionals of convex polytopes with few vertices

Xia Li, Lingxu Meng, Senlin Wu

Published 2021-11-14Version 1

By using elementary yet interesting observations and refining techniques used in a recent work by Fei Xue et al., we present new upper bounds for covering functionals of convex polytopes in $\mathbb{R}^n$ with few vertices. In these estimations, no information other than the number of vertices of the convex polytope is used.

Related articles: Most relevant | Search more
arXiv:math/0608426 [math.MG] (Published 2006-08-16, updated 2007-10-03)
New upper bounds for kissing numbers from semidefinite programming
arXiv:1910.11638 [math.MG] (Published 2019-10-25)
Locating diametral points
arXiv:2211.04406 [math.MG] (Published 2022-11-08)
Multiple Packing: Lower and Upper Bounds