On T-avoiding spherical codes and designs in 32-dimensional Euclidean space
DOI:
https://doi.org/10.55630/mem.2026.55.382-392Keywords:
spherical codes, spherical designs, linear programmingAbstract
In this article, we show that the minimal vectors of the extremal even unimodular lattices in R^{32} define T-avoiding universally optimal spherical codes for suitable sets T. Moreover, these codes are minimal T-avoiding spherical designs and maximal Tavoiding codes for appropriate choices of T.
References
S. V. BORODACHOV, D. P. HARDIN, and E. B. SAFF. Discrete Energy on Rectifiable Sets. Springer Monographs in Mathematics. Springer, 2019.
W. BOSMA, J. CANNON, and C. PLAYOUST. The Magma algebra system. I. The user language. Journal of Symbolic Computation, 24:235–265, 1997.
P. BOYVALENKOV and D. CHERKASHIN. The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000. Results in Mathematics, 80, 2025. Article 3.
P. BOYVALENKOV, D. CHERKASHIN, and P. DRAGNEV. Universal optimality of T-avoiding spherical codes and designs. arXiv:2501.13906, 2025.
P. BOYVALENKOV and P. DRAGNEV. Energy of codes with forbidden distances in 48 dimensions. Accepted in Applied and Numerical Harmonic Analysis (Springer book series), 2025.
H. COHN and A. KUMAR. Universally optimal distribution of points on spheres. Journal of the American Mathematical Society, 20(1):99–148, 2007.
H. COHN, A. KUMAR, S. D. MILLER, D. RADCHENKO, and M. VIAZOVSKA. The sphere packing problem in dimension 24. Annals of Mathematics, 185:1017–1033, 2017.
H. COHN, A. KUMAR, S. D. MILLER, D. RADCHENKO, and M. VIAZOVSKA. Universal optimality of the E8 and Leech lattices and interpolation formulas. Annals of Mathematics, 196:983–1082, 2022.
J. H. CONWAY and V. PLESS. On the enumeration of self-dual codes. Journal of Combinatorial Theory, Series A, 28:26–53, 1980.
J. H. CONWAY and N. J. A. SLOANE. Sphere Packings, Lattices and Groups. Springer, New York, 3rd edition, 1999.
P. DELSARTE, J.-M. GOETHALS, and J. J. SEIDEL. Spherical codes and designs. Geometriae Dedicata, 6:363–388, 1977.
F. GONCALVES and G. VEDANA. Sphere packings in Euclidean space with forbidden distances. Forum of Mathematics, Sigma, 13:e49, 2025. Cambridge University Press.
A. HEIMENDAHL, A. MARAFIOTI, A. THIEMEYER, F. VALLENTIN, and M. C. ZIMMERMANN. Critical even unimodular lattices in the Gaussian core model. International Mathematics Research Notices, 2023(6):5352–5396, 2023.
O. KING. A mass formula for unimodular lattices with no roots. Mathematics of Computation, 72:839–863, 2003.
V. I. LEVENSHTEIN. Designs as maximum codes in polynomial metric spaces. Acta Applicandae Mathematicae, 25:1–82, 1992.
V. I. LEVENSHTEIN. Universal bounds for codes and designs. In V. S. PLESS and W. C. HUFFMAN, editors, Handbook of Coding Theory, chapter 6, pages 499–648. Elsevier, Amsterdam, 1998.
G. NEBE. Boris Venkov’s theory of lattices and spherical designs. In Diophantine Methods, Lattices, and Arithmetic Theory of Quadratic Forms. Volume 587, Contemporary Mathematics. AMS, 2013.
I. J. SCHOENBERG. Positive definite functions on spheres. Duke Mathematical Journal, 9:96–108, 1942.
G. SZEGO. Orthogonal Polynomials. AMS, Providence, RI, 1975.
B. B. VENKOV. Even unimodular Euclidean lattices of dimension 32. Zap. Nauchn. Sem. LOMI, 116:44–55, 1982. In Russian.
B. B. VENKOV and H. KOCH. Uber ganzzahlige unimodulare euklidische Gitter. J. Reine Angew. Math., 398:144–168, 1989.
M. VIAZOVSKA. The sphere packing problem in dimension 8. Annals of Mathematics, 185:991–1015, 2017.
