On kissing numbers and spherical codes in high dimensions
classification
🧮 math.MG
math.COmath.PR
keywords
boundlowerdimensiondimensionsfactorhighkissinglinear
read the original abstract
We prove a lower bound of $\Omega (d^{3/2} \cdot (2/\sqrt{3})^d)$ on the kissing number in dimension $d$. This improves the classical lower bound of Chabauty, Shannon, and Wyner by a linear factor in the dimension. We obtain a similar linear factor improvement to the best known lower bound on the maximal size of a spherical code of acute angle $\theta$ in high dimensions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.