A quantitative program for Hadwiger's covering conjecture (Q625865): Difference between revisions

In ``Ungelöste Probleme'' [Elem. Math. 20., No. 12, p. 121 (1957)] \textit{H. Hadwiger} formulated his famous conjecture: ``For every \(n\)-dimensional convex body \(K\) we have \(c(K) \leq 2^n\) where the equality holds if and only if \(K\) a is parallelepiped and \(c(K)\) denotes the smallest number of translates of \(int(K)\) that their union can cover \(K\)''. In [Fundam. Math. 20, 177--190 (1933; Zbl 0006.42403)], \textit{K. Borsuk} conjectured that every \(n\)-dimensional bounded set can be divided into \(n+1\) subsets of smaller diameters. A lot of nice results have been achieved related to the mentioned conjectures. The author suggests a four-step program to attack Hadwiger's conjecture and as well as Borsuk's conjecture using the \(\gamma_m(K)\) function, defined as the smallest positive number \(r\) such that \(K\) can be covered by \(m\) translates of \(rK\). This program is based on the properties of the \(\gamma_m(K)\) function which is continuous on the bounded, connected and compact space of all \(n\)-dimensional convex bodies, denoted by \(\mathcal{K}^n\). Moreover, the author proves some partial results in this topic related to the above function.