ArcXiv

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 1/3. Motivated by the maximality of the exceptional root system E8, we define strong maximality of a Seidel matrix, and show that every Seidel matrix achieving the absolute bound is strongly maximal.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…