A triangle can be covered by three smaller copies of itself; a square requires four smaller copies

In combinatorial geometry, the Hadwiger conjecture states that any convex body in n-dimensional Euclidean space can be covered by 2ⁿ or fewer smaller bodies homothetic with the original body, and that furthermore, the upper bound of 2ⁿ is necessary if and only if the body is a parallelepiped. There also exists an equivalent formulation in terms of the number of floodlights needed to illuminate the body.

The Hadwiger conjecture is named after Hugo Hadwiger, who included it on a list of unsolved problems in 1957; it was, however, previously studied by Levi (1955) and independently, Gohberg & Markus (1960). Additionally, there is a different Hadwiger conjecture concerning graph coloring—and in some sources the geometric Hadwiger conjecture is also called the Levi–Hadwiger conjecture or the Hadwiger–Levi covering problem.

The conjecture remains unsolved even in three dimensions, though the two dimensional case was resolved by Levi (1955).

Formal statement

Formally, the Hadwiger conjecture is: If K is any bounded convex set in the n-dimensional Euclidean space Rⁿ, then there exists a set of 2ⁿ scalars s_i and a set of 2ⁿ translation vectors v_i such that all s_i lie in the range 0 < s_i < 1, and

${\displaystyle K\subseteq \bigcup _{i=1}^{2^{n}}s_{i}K+v_{i}.}$

Furthermore, the upper bound is necessary iff K is a parallelepiped, in which case all 2ⁿ of the scalars may be chosen to be equal to 1/2.

Examples

As shown in the illustration, a triangle may be covered by three smaller copies of itself, and more generally in any dimension a simplex may be covered by n + 1 copies of itself, scaled by a factor of n/(n + 1). However, covering a square by smaller squares (with parallel sides to the original) requires four smaller squares, as each one can cover only one of the larger square's four corners. In higher dimensions, covering a hypercube or more generally a parallelepiped by smaller homothetic copies of the same shape requires a separate copy for each of the vertices of the original hypercube or parallelepiped; because these shapes have 2ⁿ vertices, 2ⁿ smaller copies are necessary. This number is also sufficient: a cube or parallelepiped may be covered by 2ⁿ copies, scaled by a factor of 1/2. Hadwiger's conjecture is that parallelepipeds are the worst case for this problem, and that any other convex body may be covered by fewer than 2ⁿ smaller copies of itself.^[1]

Known results

The two-dimensional case was settled by Levi (1955): every two-dimensional bounded convex set may be covered with four smaller copies of itself, with the fourth copy needed only in the case of parallelograms. However, the conjecture remains open in higher dimensions except for some special cases. The best known asymptotic upper bound on the number of smaller copies needed to cover a given body is^[2]

${\displaystyle \displaystyle 4^{n}\exp \left({\frac {-cn}{\log(n)}}\right)}$

where ${\displaystyle c}$ is a positive constant. For small ${\displaystyle n}$ the upper bound of ${\displaystyle (n+1)n^{n-1}-(n-1)(n-2)^{n-1}}$ established by Lassak (1988) is better than the asymptotic one. In three dimensions it is known that 16 copies always suffice, but this is still far from the conjectured bound of 8 copies.^[1]

The conjecture is known to hold for certain special classes of convex bodies, including, in dimension three, centrally symmetric polyhedra and bodies of constant width.^[1] The number of copies needed to cover any zonotope (other than a parallelepiped) is at most ${\displaystyle (3/4)2^{n}}$, while for bodies with a smooth surface (that is, having a single tangent plane per boundary point), at most ${\displaystyle n+1}$ smaller copies are needed to cover the body, as Levi already proved.^[1]

See also

• Borsuk's conjecture on covering convex bodies with sets of smaller diameter

Notes

References

• Boltjansky, V.; Gohberg, Israel (1985), "11. Hadwiger's Conjecture", Results and Problems in Combinatorial Geometry, Cambridge University Press, pp. 44–46.
• Brass, Peter; Moser, William; Pach, János (2005), "3.3 Levi–Hadwiger Covering Problem and Illumination", Research Problems in Discrete Geometry, Springer-Verlag, pp. 136–142.
• Campos, Marcelo; van Hintum, Peter; Morris, Robert; Tiba, Marius (2023), "Towards Hadwiger's Conjecture via Bourgain Slicing", International Mathematics Research Notices, arXiv:2206.11227, doi:10.1093/imrn/rnad198.
• Gohberg, Israel Ts.; Markus, Alexander S. (1960), "A certain problem about the covering of convex sets with homothetic ones", Izvestiya Moldavskogo Filiala Akademii Nauk SSSR (in Russian), 10 (76): 87–90.
• Hadwiger, Hugo (1957), "Ungelöste Probleme Nr. 20", Elemente der Mathematik, 12: 121.
• Huang, Han; Slomka, Boaz A.; Tkocz, Tomasz; Vritsiou, Beatrice-Helen (2022), "Improved bounds for Hadwiger's covering problem via thin-shell estimates", Journal of the European Mathematical Society, 24 (4): 1431–1448, arXiv:1811.12548, doi:10.4171/jems/1132, ISSN 1435-9855.
• Lassak, Marek (1988), "Covering the boundary of a convex set by tiles", Proceedings of the American Mathematical Society, 104 (1): 269–272, doi:10.1090/s0002-9939-1988-0958081-7, MR 0958081.
• Levi, Friedrich Wilhelm (1955), "Überdeckung eines Eibereiches durch Parallelverschiebungen seines offenen Kerns", Archiv der Mathematik, 6 (5): 369–370, doi:10.1007/BF01900507, S2CID 121459171.