Uniacute spherical codes
arrangements of pointsextremal combinatoricsflats, hyperplanesgraphs and matricesmetric geometrypacking and covering
Combinatorial aspects of packing and covering (05B40) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Metric geometry (51F99) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Theory of error-correcting codes and error-detecting codes (94B99)
This paper makes significant progress in the study of spherical \(L\)-codes, particularly those with exactly one acute angle -- so-called uniacute codes. Building on prior results by \textit{B. Bukh} [SIAM J. Discrete Math. 30, No. 1, 549--554 (2016; Zbl 1333.05309)], the authors resolve when the known uniform bound on the size of such codes is tight, using a novel global structure theorem and introducing the concept of modular codes. The work is technically sophisticated, contributes a new structural understanding of spherical configurations in high dimensions, and contains a rich mix of combinatorial, geometric, and spectral methods.
- Bounds on equiangular lines and on related spherical codes
- Equiangular lines
- Equiangular lines and spherical codes in Euclidean space
- Equiangular lines with a fixed angle
- Equiangular subspaces in Euclidean spaces
- Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines
- Graph representations, two-distance sets, and equiangular lines
- Graphs with high second eigenvalue multiplicity
- scientific article; zbMATH DE number 3633251 (Why is no real title available?)
- scientific article; zbMATH DE number 1149836 (Why is no real title available?)
- scientific article; zbMATH DE number 3428111 (Why is no real title available?)
- New construction of mutually unbiased bases in square dimensions
- On kissing numbers and spherical codes in high dimensions
- On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
- Spherical codes and designs
- Spherical two-distance sets and eigenvalues of signed graphs
This page was built for publication: Uniacute spherical codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6999748)