2000 character limit reached
On kissing numbers and spherical codes in high dimensions
Published 7 Mar 2018 in math.MG, math.CO, and math.PR | (1803.02702v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.