A quantitative program for Hadwiger's covering conjecture

From MaRDI portal
Revision as of 08:17, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:625865

DOI10.1007/S11425-010-4087-3zbMath1237.52014arXiv0911.4580OpenAlexW2073482379WikidataQ123190388 ScholiaQ123190388MaRDI QIDQ625865

Chuan Ming Zong

Publication date: 25 February 2011

Published in: Science China. Mathematics (Search for Journal in Brave)

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




Related Items (25)

Borsuk's partition problem in ℓₚ⁴A New Bound for Hadwiger’s Covering Problem in \(\boldsymbol{\mathbb{E}}^3\)Covering functionals of cones and double conesSpherical coverings and X-raying convex bodies of constant widthCovering the boundary of a convex body with its smaller homothetic copiesMinkowski Geometry—Some Concepts and Recent DevelopmentsOn the covering index of convex bodiesCovering functionals of convex polytopes with few verticesCovering convex hulls of compact convex sets with smaller homothetic copiesEstimations of covering functionals of simplicesOn Boltyanski and Gohberg's partition conjectureCovering unit spheres and balls of normed spaces by smaller ballsA branch-and-bound approach for estimating covering functionals of convex bodiesCovering functionals of Minkowski sums and direct sums of convex bodiesBorsuk's partition problem and finite point setsHomothetic covering of convex hulls of compact convex setsCharacterizations of \(l_\infty^n\) and \(l_1^n\), and their stabilitiesCovering functionals of convex polytopesCovering a convex body vs. covering the set of its extreme pointsCube is a strict local maximizer for the illumination numberOn covering functionals of convex bodiesPartition bounded sets into sets having smaller diametersBorsuk's partition conjectureBorsuk's partition problem in \((\mathbb{R}^n,\ell_p)\)Functionals on the spaces of convex bodies




Cites Work




This page was built for publication: A quantitative program for Hadwiger's covering conjecture