Hadwiger's covering conjecture for convex bodies

About 5 years old · traced to

Let KK be a convex body in Rn\mathbb{R}^n, meaning a compact convex set with interior points, and let c(K)c(K) be the least number of translates of the relative interior of KK needed to cover KK.

Hadwiger's covering conjecture. For each K∈KnK\in\mathcal{K}^n, c(K)c(K) is bounded from above by 2n2^n, and this upper bound is attained only by parallelotopes.

Hadwiger's covering conjecture concerns the least upper bound of the covering numbers of convex bodies. The source presents it as a longstanding conjecture and gives references for further information; no resolution is stated here.

References

Primary source

Senlin Wu, Keke Zhang and Chan He, “Homothetic covering of convex hulls of compact convex sets”, arXiv:2104.08868 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.