%ASardari, Naser%AZargar, Masoud%BJournal Name: Mathematische Annalen; Related Information: CHORUS Timestamp: 2023-10-19 00:03:37
%D2023%ISpringer Science + Business Media; None
%JJournal Name: Mathematische Annalen; Related Information: CHORUS Timestamp: 2023-10-19 00:03:37
%K
%MOSTI ID: 10469879
%PMedium: X
%TNew upper bounds for spherical codes and packings
%XAbstract
We improve the previously best known upper bounds on the sizes of$$\theta $$$\theta $-spherical codes for every$$\theta <\theta ^*\approx 62.997^{\circ }$$$\theta <{\theta}^{\ast}\approx 62.{997}^{\circ}$at least by a factor of 0.4325, in sufficiently high dimensions. Furthermore, for sphere packing densities in dimensions$$n\ge 2000$$$n\ge 2000$we have an improvement at least by a factor of$$0.4325+\frac{51}{n}$$$0.4325+\frac{51}{n}$. Our method also breaks many non-numerical sphere packing density bounds in smaller dimensions. This is the first such improvement for each dimension since the work of Kabatyanskii and Levenshtein (Problemy Peredači Informacii 14(1):3–25, 1978) and its later improvement by Levenshtein (Dokl Akad Nauk SSSR 245(6):1299–1303, 1979) . Novelties of this paper include the analysis of triple correlations, usage of the concentration of mass in high dimensions, and the study of the spacings between the roots of Jacobi polynomials.

%0Journal Article