On the classification of triply-transitive strongly-regular graphs
Abstract
Let = (,E) be a strongly-regular graph with adjacency matrix A1, and let A2 be the adjacency matrix of its complement. For any vertex ω∈ , we define E0,ω* E1,ω* and E2,ω* to be respectively the diagonal matrices whose main diagonal is the row corresponding to ω in the matrices I, A1, and A2. The Terwilliger algebra of with respect to the vertex ω∈ is the subalgebra Tω = I,A1,A2,E0,ω*,E1,ω*,E2,ω* of the complex matrix algebra M||(C). The algebra Tω contains the subspace T0,ω = Span\ Ei,ω*AjEk,ω*: 0≤ i,j,k≤ 2 \. In addition, if G = , then Tω is a subalgebra of the centralizer algebra Tω = GωC. The strongly-regular graph =(,E) is triply transitive if is vertex transitive and T0,ω = Tω = Tω, for any ω ∈ . In this paper, we classify all triply transitive strongly-regular graphs that are not isomorphic to the collinearity graph of the polar space O6-(q), where q is a prime power, or the affine polar graph 2m(2), where m≥ 1 and = 1.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.