On Hadwiger’s covering problem in small dimensions

Abstract Let $H_n$ be the minimal number such that any n -dimensional convex body can be covered by $H_n$ translates of the interior of that body. Similarly $H_n^s$ is the corresponding quantity for symmetric bodies. It is possible to define $H_n$ and $H_n^s$ in terms of illumination of the boundary of the body using external light sources, and the famous Hadwiger’s covering conjecture (illumination conjecture) states that $H_n=H_{n}^s=2^n$ . In this note, we obtain new upper bounds on $H_n$ and $H_{n}^s$ for small dimensions n . Our main idea is to cover the body by translates of John’s ellipsoid (the inscribed ellipsoid of the largest volume). Using specific lattice coverings, estimates of quermassintegrals for convex bodies in John’s position, and calculations of mean widths of regular simplexes, we prove the following new upper bounds on $H_n$ and $H_n^s$ : $H_5\le 933$ , $H_6\le 6137$ , $H_7\le 41377$ , $H_8\le 284096$ , $H_4^s\le 72$ , $H_5^s\le 305$ , and $H_6^s\le 1292$ . For larger n , we describe how the general asymptotic bounds $H_n\le \binom {2n}{n}n(\ln n+\ln \ln n+5)$ and $H_n^s\le 2^n n(\ln n+\ln \ln n+5)$ due to Rogers, Shephard and Roger, Zong, respectively, can be improved for specific values of n .

Authors

Institutions

Publication Details

Journal
Canadian Mathematical Bulletin
Published
2025-04-04
DOI
https://doi.org/10.4153/s0008439525000384
Citations
1
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
3.54
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Hadwiger’s covering problem in small dimensions

A. Arman, Andriy Prymak, A. Bondarenko
1 citations
Canadian Mathematical Bulletin
Computational Geometry and Mesh Generation
3.54
article

On Hadwiger’s covering problem in small dimensions

A. Arman, Andriy Prymak, A. Bondarenko
article en
1 citations

Abstract

Abstract Let $H_n$ be the minimal number such that any n -dimensional convex body can be covered by $H_n$ translates of the interior of that body. Similarly $H_n^s$ is the corresponding quantity for symmetric bodies. It is possible to define $H_n$ and $H_n^s$ in terms of illumination of the boundary of the body using external light sources, and the famous Hadwiger’s covering conjecture (illumination conjecture) states that $H_n=H_{n}^s=2^n$ . In this note, we obtain new upper bounds on $H_n$ and $H_{n}^s$ for small dimensions n . Our main idea is to cover the body by translates of John’s ellipsoid (the inscribed ellipsoid of the largest volume). Using specific lattice coverings, estimates of quermassintegrals for convex bodies in John’s position, and calculations of mean widths of regular simplexes, we prove the following new upper bounds on $H_n$ and $H_n^s$ : $H_5\le 933$ , $H_6\le 6137$ , $H_7\le 41377$ , $H_8\le 284096$ , $H_4^s\le 72$ , $H_5^s\le 305$ , and $H_6^s\le 1292$ . For larger n , we describe how the general asymptotic bounds $H_n\le \binom {2n}{n}n(\ln n+\ln \ln n+5)$ and $H_n^s\le 2^n n(\ln n+\ln \ln n+5)$ due to Rogers, Shephard and Roger, Zong, respectively, can be improved for specific values of n .

Canadian Mathematical BulletinVol. 68(4)
Norwegian University of Science and Technology (NO), University of Manitoba (CA)
Openalex Percentile: Top 11%
Computational Geometry and Mesh Generation
3.54
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.