Covering functionals of convex polytopes with few vertices

DOI10.1007/S00013-022-01727-ZMaRDI QIDQ2161400zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 4 August 2022

Published in Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2111.07323

zbMATH Keywords

convex bodyconvex polytopecovering functionalHadwiger's covering conjecture

Mathematics Subject Classification ID

Convex sets in (3) dimensions (including convex surfaces) (52A15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

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 $mathbb{R}^n$ with few vertices. In these estimations, no information other than the number of vertices of the convex polytope is used.

Review text

Motivated by Hadwiger's covering conjecture, the authors investigate the covering functional of convex bodies. This functional takes a natural number \(m\) and a convex body \(K\) as inputs, and is defined as the minimum dilation factor \(\gamma\) such that the convex body is the subset of the union of \(m\) translates of \(\gamma K\). In Section 3, the covering functional of \(\ell_p\)-balls in \(\mathbb{R}^n\) and of their portions in the nonnegative orthant are studied. This is done by providing explicit unions of dilated translates covering the original bodies, involving lattice points in crosspolytopes. In Theorem 8, it is shown that the covering functional of the \(\ell_1\)-ball in \(\mathbb{R}^m\) and its portion in the nonnegative orthant are upper bounds for the covering functional of convex polytopes with \(m+1\) vertices and centrally symmetric polytopes with \(2m\) vertices, respectively. The main theorem of this paper (Theorem 9) then gives upper bounds of the covering functional at \(2^n\) of polytopes with \(m\geq n+1\) vertices and centrally symmetric polytopes with \(2m\geq 2n\) vertices, purely in terms of \(n\) and \(m\).

Recommendations

• Covering functionals of convex polytopes
• Functional covering numbers
• On covering functionals of convex bodies
• Covering functionals of cones and double cones
• Covering functionals of Minkowski sums and direct sums of convex bodies

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)