Vertex-primitive $s$-arc-transitive Cayley digraphs
Jing Jian Li, Yong Tang Shi, Yu Wang, Binzhou Xia

TL;DR
This paper proves that the maximum value of s for finite vertex-primitive s-arc-transitive Cayley digraphs is 2 and fully characterizes their structure when s=2.
Contribution
It establishes the exact upper bound of 2 for s and provides a complete structural characterization for the case s=2.
Findings
Maximum s is exactly 2 for these digraphs.
Complete classification of structures when s=2.
Progress on a longstanding open problem.
Abstract
Determining an upper bound on for vertex-primitive -arc-transitive digraphs has been an open problem of considerable interest since a question asked by Praeger in 1990. Although much progress has been made and an upper bound is conjectured to be , a complete classification for remains out of reach. In this paper, we prove that the tight upper bound on for finite vertex-primitive -arc-transitive Cayley digraphs is exactly . Furthermore, we completely characterize the structure of these digraphs when .
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.
