# Improved bounds for Hadwiger’s covering problem via thin-shell estimates

@article{Huang2018ImprovedBF, title={Improved bounds for Hadwiger’s covering problem via thin-shell estimates}, author={Han Huang and Boaz A. Slomka and Tomasz Tkocz and Beatrice-Helen Vritsiou}, journal={Journal of the European Mathematical Society}, year={2018} }

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most $N\left(n\right)$ of its translates. Despite continuous efforts, the best general upper bound known for this number remains as it was more than sixty years ago, of the order of ${2n \choose n}n\ln n$. In this note, we improve this bound by a sub-exponential…

## 19 Citations

### Spherical coverings and X-raying convex bodies of constant width

- MathematicsCanadian Mathematical Bulletin
- 2021

The main goal of this work is to give constructions of certain spherical coverings in small dimensions. K. Bezdek and Gy. Kiss showed that existence of origin-symmetric coverings of unit sphere in…

### Regular ellipsoids and a Blaschke-Santal\'o-type inequality for projections of non-symmetric convex bodies

- Mathematics
- 2023

It is shown that every not-necessarily symmetric convex body $K$ in ${\mathbb R}^n$ has an affine image $\tilde{K}$ of $K$ such that the covering numbers of $\tilde{K}$ by growing dilates of the unit…

### Covering by homothets and illuminating convex bodies

- Mathematics
- 2019

The paper is devoted to coverings by translative homothets and illuminations of convex bodies. For a given positive number $\alpha$ and a convex body $B$, $g_{\alpha}(B)$ is the infimum of…

### Four classic problems

- Mathematics
- 2022

In this work we survey four classic problems: Borsuk’s partition problem, Tarski’s plank problem, the Kneser–Poulsen problem on the monotonicity of the union of balls under a contraction of their…

### Towards Hadwiger's conjecture via Bourgain Slicing

- Mathematics
- 2022

. In 1957, Hadwiger conjectured that every convex body in R d can be covered by 2 d translates of its interior. For over 60 years, the best known bound was of the form O (4 d √ d log d ), but this…

### On directional Whitney inequality

- MathematicsCanadian Journal of Mathematics
- 2021

It is proved that there does not exist a universal finite set of directions ${\mathcal{E}} for which this inequality holds on every convex body $\Omega\subset {\mathbb{R}}^d$, but for every connected $C^2$-domain $\O Mega\sub set {\mathBB{R}R}d), one can choose to be an arbitrary set of $d$ independent directions.

### Covering the Crosspolytope with Crosspolytopes

- Mathematics
- 2023

Let $\gamma^d_m(K)$ be the smallest positive number $\lambda$ such that the convex body $K$ can be covered by $m$ translates of $\lambda K$. Let $K^d$ be the $d$-dimensional crosspolytope. It will be…

### On Hadwiger's covering functional for the simplex and the cross-polytope

- Mathematics
- 2021

In 1957, Hadwiger made a conjecture that every n-dimensional convex body can be covered by 2n translations of its interior. The Hadwiger’s covering functional γm(K) is the smallest positive number r…

### On the illumination of centrally symmetric cap bodies in small dimensions

- Mathematics
- 2020

The illumination number I ( K ) of a convex body K in Euclidean space $$\mathbb {E}^d$$ E d is the smallest number of directions that completely illuminate the boundary of a convex body. A cap body…

## 55 References

### On some covering problems in geometry

- Mathematics, Computer Science
- 2014

A method to obtain upper bounds on covering numbers is presented, not probabilistic, and the key idea, which makes the proofs rather simple and uniform through different settings, is an algorithmic result of Lov\'asz and Stein.

### Cube is a Strict Local Maximizer for the Illumination Number

- MathematicsDiscret. Comput. Geom.
- 2020

It is shown that if a convex body is close to the cube in the Banach–Mazur metric, and it is not a parallelotope, then indeed 2 n - 1 light sources suffice to illuminate its boundary.

### Interpolating Thin-Shell and Sharp Large-Deviation Estimates for Lsotropic Log-Concave Measures

- Mathematics
- 2010

Given an isotropic random vector X with log-concave density in Euclidean space $${\mathbb{R}^n}$$ , we study the concentration properties of |X| on all scales, both above and below its expectation.…

### Fractional illumination of convex bodies

- MathematicsContributions Discret. Math.
- 2009

It is proved that for any o-symmetric convex polytope with $k$ vertices, there is a direction that illuminates at least $\left\lceil\frac{k}{2^d}\right\rceil $ vertices.

### On weighted covering numbers and the Levi-Hadwiger conjecture

- Mathematics
- 2013

We define new natural variants of the notions of weighted covering and separation numbers and discuss them in detail. We prove a strong duality relation between weighted covering and separation…

### Flavors of Translative Coverings

- Mathematics
- 2018

We survey results on the problem of covering the space \(\mathbb R^n\), or a convex body in it, by translates of a convex body. Our main goal is to present a diverse set of methods. A theorem of…

### Entropy Bounds on Abelian Groups and the Ruzsa Divergence

- MathematicsIEEE Transactions on Information Theory
- 2018

This paper isolates and study a key quantity, the Ruzsa divergence between two probability distributions, and shows that its properties can be used to extend the earlier inequalities to the present general setting of random variables taking values in R n.

### The star number of coverings of space with convex bodies

- Mathematics
- 1964

1. When a system of sets covers a space, the star number of the covering is the supremum over the sets of the system of the cardinals of the numbers of sets of the system meeting a set of the system…

### Solution of Hadwiger-Levi's Covering Problem for Duals of Cyclic 2k-Polytopes

- Mathematics
- 1999

For a collection C of convex bodies let h(C) be the minimum number m with the property that every element K of C can be covered by m or fewer smaller homothetic copies of K. Denote by Cd* the…

### Stochastic localization + Stieltjes barrier = tight bound for log-Sobolev

- MathematicsSTOC
- 2018

It is proved that the log-Sobolev constant of any isotropic logconcave density in Rn with support of diameter D is Ω(1/D), resolving a question posed by Frieze and Kannan in 1997 and is asymptotically the best possible estimate.