On the prime spectrum of an automorphism group of an ${\rm AT4}(p,p+2,r)$-graph
Ludmila Tsiovkina

TL;DR
This paper investigates the automorphism groups of a special class of graphs called ${\rm AT4}(p,p+2,r)$-graphs, providing bounds on their prime spectra and restrictions on their structure, especially when $p$ is a prime power.
Contribution
It establishes upper bounds for the prime spectrum of automorphism groups and restrictions on their structure for ${\rm AT4}(p,p+2,r)$-graphs, advancing classification efforts.
Findings
No arc-transitive ${\rm AT4}(p,p+2,r)$-graphs exist for $p=11,17,27$
Provides bounds on prime spectra of automorphism groups
Restrictions on automorphism group structures when $p$ is a prime power
Abstract
This paper is devoted to the problem of classification of -graphs. There is a unique -graph with , namely, the distance-transitive Soicher graph with intersection array , whose local graphs are isomorphic to the Gewirtz graph. It is still unknown whether an -graph with exists. The local graphs of each -graph are strongly regular with parameters . In the present paper, we find an upper bound for the prime spectrum of an automorphism group of a strongly regular graph with such parameters, and we also obtain some restrictions for the prime spectrum and the structure of an automorphism group of an -graph in case when is a prime power. As a corollary, we show that there are no arc-transitive ${\rm…
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 · Coding theory and cryptography · graph theory and CDMA systems
