Covering functionals of convex polytopes with few vertices
From MaRDI portal
Abstract: 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 with few vertices. In these estimations, no information other than the number of vertices of the convex polytope is used.
Recommendations
Cites work
- A quantitative program for Hadwiger's covering conjecture
- A Remark on Stirling's Formula
- Classical topics in discrete geometry
- Combinatorial problems on the illumination of convex bodies
- Covering functionals of convex polytopes
- Excursions into combinatorial geometry
- scientific article; zbMATH DE number 194266 (Why is no real title available?)
- Intrinsic volumes and lattice points of crosspolytopes
- Problems and theorems in analysis. I. Series, integral calculus, theory of functions. Transl. from the German by Dorothee Aeppli
- Research Problems in Discrete Geometry
- The geometry of homothetic covering and illumination
Cited in
(9)- Covering functionals of convex polytopes
- Regular random sections of convex bodies and the random quotient-of-subspace theorem
- The covering radius and a discrete surface area for non-hollow simplices
- Covering convex hulls of compact convex sets with smaller homothetic copies
- Covering functionals of Minkowski sums and direct sums of convex bodies
- On covering functionals of convex bodies
- Estimations of covering functionals of simplices
- New covering and illumination results for a class of polytopes
- Covering the unit ball of _p^n with smaller balls and related inequalities
This page was built for publication: Covering functionals of convex polytopes with few vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2161400)