Papers
Topics
Authors
Recent
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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.