arXiv · 2102.11989
Maximality of Seidel matrices and switching roots of graphs
Abstract
In this paper, we discuss maximality of Seidel matrices with a fixed largest eigenvalue. We present a classification of maximal Seidel matrices of largest eigenvalue $3$, which gives a classification of maximal equiangular lines in a Euclidean space with angle $\arccos1/3$. Motivated by the maximality of the exceptional root system $E_8$, we define strong maximality of a Seidel matrix, and show that every Seidel matrix achieving the absolute bound is strongly maximal.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Meng-Yue Cao, Jack H. Koolen, Akihiro Munemasa, Kiyoto Yoshino. 2021-02-24. Maximality of Seidel matrices and switching roots of graphs. https://arxiv.org/abs/2102.11989
Cite the original work for its findings. Save a collection to share your selection of sources.