Multiple packing of the Euclidean sphere
Let \(S\) be a sphere with radius \(\sqrt{n\varepsilon}\) in \(\mathbb{R}^n\), and \(L\) a natural number. Denote by \(M_n(\varepsilon, \rho)\) the maximum number of balls of radius \(\sqrt n\rho\), centered on \(S\), such that every point of \(\mathbb{R}^n\) belongs to at most \(L\) such balls. The author is interested in bounds of the rough logarithmic asymptotic of \(M_n(\varepsilon, \rho)\), i.e. the value \[ R(\varepsilon, \rho)= \limsup_{n\to\infty} {\ln M_n(\varepsilon, \rho)\over n}. \] Assume \(\rho^2\leq{L\varepsilon\over L+1}\) (otherwise \(R(\varepsilon, \rho)= 0\)). Blachman and Few (1963) proved that \(R(\varepsilon, \rho)\leq{1\over 2}\ln{L\varepsilon\over (L+1)\rho^2}\). For \(L= 1\) Shannon (1959) improved the bound to \[ R(\varepsilon, \rho)\leq {1\over 2}\ln{\varepsilon\over 2\rho^2}+{1\over 2}\ln {1\over 2(1- \rho^2/\varepsilon)}. \] Here the author generalizes this result to arbitrary \(L\): \[ R(\varepsilon, \rho)\leq{1\over 2}\ln {L\varepsilon\over (L+1)\rho^2}+ {1\over 2L}\ln {1\over (L+ 1)(1- \rho^2/\varepsilon)}. \]
- Random sphere packing
- scientific article; zbMATH DE number 1498787 (Why is no real title available?)
- Epsilon entropy and the packing of balls in Euclidean space
- Packing congruent spheres into a multi‐connected polyhedral domain
- New asymptotic bounds on the size of multiple packings of the Euclidean sphere
This page was built for publication: Multiple packing of the Euclidean sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701394)
