On $T$-avoiding spherical codes and designs in $\mathbb{R}^{32}$
Combinatorics
2025-12-30 v1
Abstract
In this article, we show that the minimal vectors of the extremal even unimodular lattices in are -avoiding universally optimal for suitable sets . Moreover, they are minimal -avoiding spherical designs and maximal -avoiding codes for appropriate choices of .
Cite
@article{arxiv.2512.23092,
title = {On $T$-avoiding spherical codes and designs in $\mathbb{R}^{32}$},
author = {P. Boyvalenkov and D. Cherkashin and P. Dragnev and D. Yorgov and V. Yorgov},
journal= {arXiv preprint arXiv:2512.23092},
year = {2025}
}
Comments
10 pages