On covering a set in \(R^ N\) by balls of the same diameter (Q4037244)

[For the entire collection see Zbl 0755.00015.] \textit{C. A. Rogers} [Mathematika, London 10, 157-164 (1963; Zbl 0158.196)] proved that for each \(\varepsilon>0\) every set of diameter 1 in \(\mathbb{R}^ n\) can be covered by \((\sqrt {2}+ \varepsilon)^ n\) balls of radius 1/2 for large \(n\geq n(\varepsilon)\). In this paper this upper bound is improved and also a lower estimation is given. Let \(c_ n\) be the smallest integer such that each subset of diameter 1 in \(\mathbb{R}^ n\) can be covered by \(c_ n\) balls of radius \(1/2\). Then for each \(\varepsilon>0\) and large \(n\geq n(\varepsilon)\) we have \((\sqrt {9/8} - \varepsilon )^ n\leq c_ n\leq (\sqrt{3/2} +\varepsilon)^ n\).