A quantitative program for Hadwiger's covering conjecture
Publication:625865
DOI10.1007/S11425-010-4087-3zbMath1237.52014arXiv0911.4580OpenAlexW2073482379WikidataQ123190388 ScholiaQ123190388MaRDI QIDQ625865
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
convex bodyBorsuk's conjectureHadwiger's conjecture\(\beta\)-netBanach-Mazur metricBlaschke's selection theorem
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Combinatorial aspects of packing and covering (05B40)
Related Items (25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Überdeckungen der Kugel mit höchstens acht Kreisen
- Covering a plane convex body with five smaller homothetical copies
- Solution of Hadwiger-Levi's covering problem for duals of cyclic \(2k\)-polytopes
- Combinatorial problems on the illumination of convex bodies
- An estimate for the problem of illumination of the boundary of a convex body in \(E^3\)
- A proof of Hadwiger's covering conjecture for dual cyclic polytopes
- New sets with large Borsuk numbers
- Some remarks concerning kissing numbers, blocking numbers and covering numbers
- The illumination conjecture and its extensions
- Excursions into combinatorial geometry
- Ein geometrisches Überdeckungsproblem
- A counterexample to Borsuk’s conjecture
- Research Problems in Discrete Geometry
- Illumination of direct vector sums of convex bodies
- Covering convex bodies by translates of convex bodies
- Convex and Discrete Geometry
- Measure of Asymmetry of Convex Curves
- Kreisüberdeckungen der hyperbolische Ebene
- Solution of the illumination problem for bodies with md \(M=2\)
This page was built for publication: A quantitative program for Hadwiger's covering conjecture