Universal Optimality of T-avoiding Spherical Codes and Designs
Constructive Approximation · 2026-08 · 64 (1) · 145-182
DOI: 10.1007/s00365-026-09759-2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Constructive Approximation, online erschienen am 26.05.2026. Verfasst von P. G. Boyvalenkov und 2 weiteren Autor:innen. Die Arbeit nennt 33 Literaturangaben.
Abstract (Originalsprache)
Given an open set T⊂[-1,1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T\subset [-1,1)$$\end{document}, we introduce the concepts of T-avoiding spherical codes and designs, that is, spherical codes that have no inner products in the set T. We show that certain codes found in the minimal vectors of the Leech lattice, as well as the minimal vectors of the Barnes–Wall lattice and codes derived from strongly regular graphs, are universally optimal in the restricted class of T-avoiding codes. We also extend a result of Delsarte–Goethals–Seidel about codes with three inner products α,β,γ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha , \beta , \gamma $$\end{document} (in our terminology (α,β)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(\alpha ,\beta )$$\end{document}-avoiding γ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma $$\end{document}-codes). Parallel to the notion of tight spherical designs, we also derive that these codes are minimal (tight) T-avoiding spherical designs of fixed dimension and strength. In some cases, we also find that codes under consideration have maximal cardinality in their T-avoiding class for given dimension and minimum distance.
Zitieren
APA
Boyvalenkov, P. G., Cherkashin, D. D., & Dragnev, P. D. (2026). Universal Optimality of T-avoiding Spherical Codes and Designs. Constructive Approximation, 64(1), 145-182. https://doi.org/10.1007/s00365-026-09759-2
Vancouver
Boyvalenkov PG, Cherkashin DD, Dragnev PD. Universal Optimality of T-avoiding Spherical Codes and Designs. Constructive Approximation. 2026;64(1):145-182. doi:10.1007/s00365-026-09759-2
BibTeX
@article{Boyvalenkov2026,
author = {Boyvalenkov, P. G. and Cherkashin, D. D. and Dragnev, P. D.},
title = {Universal Optimality of T-avoiding Spherical Codes and Designs},
journal = {Constructive Approximation},
year = {2026},
volume = {64},
number = {1},
pages = {145--182},
doi = {10.1007/s00365-026-09759-2}
}
EUVIMED