Vertex-primitive $s$-arc-transitive digraphs of linear groups
Michael Giudici, Cai Heng Li, Binzhou Xia

TL;DR
This paper investigates the structure of certain highly symmetric directed graphs with almost simple linear group symmetries, establishing that the maximum arc-transitivity level is two, which advances understanding of their symmetry limits.
Contribution
It proves that for vertex-primitive digraphs with socle PSL_n(q), the maximum s for s-arc-transitivity is two, providing a key step toward a general bound.
Findings
s ≤ 2 for such digraphs
First step in bounding s for all vertex-primitive s-arc-transitive digraphs
Enhances understanding of symmetry properties in linear group actions
Abstract
We study -vertex-primitive and -arc-transitive digraphs for almost simple groups with socle . It turns out that for such digraphs, which provides the first step in determining an upper bound on for all the vertex-primitive -arc-transitive digraphs.
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 · Geometric and Algebraic Topology · Advanced Operator Algebra Research
