{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/on-hadwiger-s-covering-problem-in-small","title":"On Hadwiger's covering problem in small dimensions","arxiv_id":"2404.00547","date":"2024-03-31","proceeding":null,"authors":["Andrii Arman","Andriy Bondarenko","Andriy Prymak"],"abstract":"Let $H_n$ be the minimal number such that any $n$-dimensional convex body can be covered by $H_n$ translates of 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 and Shephard can be improved for specific values of $n$.","url_abs":"https://arxiv.org/abs/2404.00547v1","url_pdf":"https://arxiv.org/pdf/2404.00547v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"on-hadwiger-s-covering-problem-in-small","repo_url":"https://github.com/andriyprm/illum-small-dims","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}