Maximality of Seidel matrices and switching roots of graphs
Meng-Yue Cao, Jack H. Koolen, Akihiro Munemasa, Kiyoto Yoshino

TL;DR
This paper classifies maximal Seidel matrices with eigenvalue 3, linking them to maximal equiangular lines, and introduces the concept of strong maximality inspired by the E8 root system.
Contribution
It provides a classification of maximal Seidel matrices with eigenvalue 3 and introduces the notion of strong maximality related to the absolute bound.
Findings
Classified all maximal Seidel matrices with eigenvalue 3.
Connected maximal Seidel matrices to maximal equiangular lines.
Defined and characterized strongly maximal Seidel matrices.
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 , which gives a classification of maximal equiangular lines in a Euclidean space with angle . Motivated by the maximality of the exceptional root system , we define strong maximality of a Seidel matrix, and show that every Seidel matrix achieving the absolute bound is strongly maximal.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Finite Group Theory Research
