On vertex-transitive distance-regular covers of complete graphs with an extremal smallest eigenvalue
Ludmila Yu. Tsiovkina

TL;DR
This paper classifies certain vertex-transitive abelian covers of complete graphs that produce extremal eigenvalues and equiangular line sets, expanding understanding of their symmetry and spectral properties.
Contribution
It provides a classification of abelian distance-regular covers with vertex-transitive automorphism groups and extremal smallest eigenvalues, using permutation group theory.
Findings
Classified covers with automorphism groups of rank at most 3.
Identified conditions for extremal eigenvalues in these covers.
Connected the covers to equiangular line sets in complex Hilbert spaces.
Abstract
The paper is devoted to the study of abelian (in the sense defined by Godsil and Hensel) distance-regular -covers of the complete graphs . According to the construction by Coutinho, Godsil, Shirazi, and Zhan (2016), each such cover yields an equiangular set of lines of size that attains the relative bound. Moreover, there are four families of abelian covers that, through this construction, yield sets of lines attaining the absolute bound. All known representatives of these families -- the hexagon, the icosahedron graph, Taylor extensions of the Schl\"afli and McLaughlin graphs together with their distance- graphs, and three other examples arising from generalized quadrangles -- have a vertex-transitive automorphism group with at most two orbits on the arc set of the cover. We aim to classify the covers from these families under the condition that the automorphism group of…
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
TopicsFinite Group Theory Research · Graph theory and applications · Coding theory and cryptography
