arxiv: 2605.01734 · v1 · submitted 2026-05-03 · 🧮 math.CO · math.GR

Recognition: unknown

Vertex-primitive s-arc-transitive Cayley digraphs

Binzhou Xia, Jing Jian Li, Yong Tang Shi, Yu Wang

Authors on Pith no claims yet

Pith reviewed 2026-05-10 16:01 UTC · model grok-4.3

classification 🧮 math.CO math.GR

keywords Cayley digraphss-arc-transitivevertex-primitiveautomorphism groupsdirected graphsfinite groups

0 comments

The pith

Finite vertex-primitive Cayley digraphs are at most 2-arc-transitive, with full structure given for s=2.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that finite Cayley digraphs whose automorphism group acts primitively on the vertices cannot be s-arc-transitive for any s greater than 2. It supplies a complete classification of the structure for all such digraphs that achieve exactly s=2. This settles the special case of a question from 1990 on upper bounds for vertex-primitive arc-transitive digraphs, but only when the digraph is also Cayley. A reader would care because the Cayley condition covers many group-generated symmetric networks, so the result sharply limits how much local symmetry these objects can possess.

Core claim

We prove that the tight upper bound on s for finite vertex-primitive s-arc-transitive Cayley digraphs is exactly 2. Furthermore, we completely characterize the structure of these digraphs when s=2.

What carries the argument

The vertex-primitivity condition on the full automorphism group of a Cayley digraph, which forces strong restrictions on the connection set and on the possible values of s.

If this is right

No finite vertex-primitive Cayley digraph can have arc-transitivity greater than 2.
All examples attaining s=2 are described by an explicit structural list.
The proof techniques rely on the interaction between the regular Cayley subgroup and the primitive action of the larger group.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same bound may fail to hold for vertex-primitive digraphs that are not Cayley, leaving the general Praeger question open.
The classification for s=2 could be used to enumerate small instances or to test further symmetry properties such as distance-regularity.
Methods developed here might adapt to study arc-transitivity in Cayley graphs on the same groups.

Load-bearing premise

The digraph is finite, admits a regular automorphism subgroup that makes it Cayley, and its full automorphism group acts primitively on the vertices.

What would settle it

Any explicit finite example of a vertex-primitive Cayley digraph that is 3-arc-transitive would disprove the claimed upper bound.

read the original abstract

Determining an upper bound on $s$ for vertex-primitive $s$-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 $2$, a complete classification for $s=2$ remains out of reach. In this paper, we prove that the tight upper bound on $s$ for finite vertex-primitive $s$-arc-transitive Cayley digraphs is exactly $2$. Furthermore, we completely characterize the structure of these digraphs when $s=2$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper settles the s=2 bound and gives a full classification for vertex-primitive s-arc-transitive Cayley digraphs.

read the letter

The paper proves that finite vertex-primitive s-arc-transitive Cayley digraphs satisfy s ≤ 2 and supplies a complete structural list for the s=2 examples. This is the central result to take away from the abstract and claim statement. It narrows the 30-year Praeger question to the Cayley subclass and resolves both the bound and the classification inside that subclass. The Cayley condition supplies a regular subgroup inside the automorphism group, which the authors use to work directly with the connection set under the primitive action. That extra structure makes the bound and the list feasible with standard group-theoretic tools. The statement is clean and the circularity burden is zero. The main limitation is that the abstract gives no lemmas or case breakdown, so the soundness of the reductions cannot be checked from what is visible. If the argument proceeds by analyzing the possible primitive representations containing a regular Cayley group and handles the exceptional cases without gaps, the result should hold. The citation pattern looks ordinary for this corner of algebraic graph theory. This work is for people already following arc-transitive digraphs and the Praeger conjecture. A reader who knows the classification of finite primitive groups will get the most from the structural list. It deserves a serious referee. The claim is precise enough that referees can verify the case analysis in reasonable time.

Referee Report

0 major / 1 minor

Summary. The manuscript proves that the maximum s for which a finite vertex-primitive s-arc-transitive Cayley digraph exists is exactly 2. It further supplies a complete structural characterization of all such digraphs attaining s=2, expressed in terms of the underlying regular group and its connection set under the primitive action.

Significance. If the argument holds, the result is a substantial advance on Praeger's 1990 question restricted to the Cayley subclass. The explicit bound s≤2 together with the classification supplies concrete examples and structural constraints that are unavailable in the general vertex-primitive setting and may serve as a template for the broader conjecture.

minor comments (1)

In the statement of the main theorem, the precise meaning of 'Cayley digraph' with respect to the regular subgroup should be restated explicitly to avoid any ambiguity with the ambient automorphism group.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript and for recommending acceptance. The referee's summary correctly identifies the main contributions: the proof that s ≤ 2 is the tight upper bound for finite vertex-primitive s-arc-transitive Cayley digraphs, together with the complete structural characterization for the case s = 2.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper proves an upper bound of s=2 for finite vertex-primitive s-arc-transitive Cayley digraphs and characterizes the s=2 case via direct group-theoretic analysis of the primitive automorphism group containing a regular Cayley subgroup and the algebraic constraints on the connection set. This uses the classification of finite primitive permutation groups and standard properties of arc-transitivity without any reduction to fitted parameters, self-definitional equations, or load-bearing self-citations. The bound and characterization are derived independently from the inputs of finiteness, the Cayley property, and primitivity, making the argument self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Only the abstract is available, so the ledger records the standard background assumptions of finite group theory and permutation group actions that any such proof must invoke.

axioms (2)

standard math Finite primitive permutation groups are known and classified up to the O'Nan-Scott theorem.
Any proof bounding arc-transitivity in primitive actions will rely on this classification or its consequences.
domain assumption Cayley digraphs admit a regular automorphism group acting on vertices.
Definition of Cayley digraph used throughout the claim.

pith-pipeline@v0.9.0 · 5405 in / 1256 out tokens · 43444 ms · 2026-05-10T16:01:49.565379+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

32 extracted references · 1 canonical work pages

[1]

Blackburn and B

N. Blackburn and B. Huppert,Finite Groups. II, Springer-Verlag, Berlin-New York (1982), xiii+531 pp

1982
[2]

Bosma, J

W. Bosma, J. Cannon and C. Playoust, The Magma algebra system. I. The user language,J. Symbolic Comput., 24 (1997), no. 3–4, 235–265. VERTEX-PRIMITIVEs-ARC-TRANSITIVE CAYLEY DIGRAPHS 13

1997
[3]

Bray, D.F

J.N. Bray, D.F. Holt and C.M. Roney-Dougal,The maximal subgroups of the low-dimensional finite classical groups, London Math. Soc. Lecture Note Ser., 407, Cambridge University Press, Cambridge (2013), xiv+438 pp

2013
[4]

Cameron,Permutation groups, London Math

P.J. Cameron,Permutation groups, London Math. Soc. Stud. Texts, 45, Cambridge University Press, Cambridge (1999), x+220 pp

1999
[5]

J. Chen, L. Chen, M. Giudici, J.J. Li, C.E. Praeger and B. Xia, Boundingsfor vertex-primitive s-arc-transitive digraphs of alternating and symmetric groups,Ars Math. Contemp., 25 (2025), no. 4, Paper No. 1, 15 pp

2025
[6]

L. Chen, M. Giudici and C.E. Praeger, Vertex-primitives-arc-transitive digraphs admitting a Suzuki or Ree group,European J. Combin., 112 (2023), Paper No. 103729, 11 pp

2023
[7]

L. Chen, M. Giudici and C.E. Praeger, Vertex-primitives-arc-transitive digraphs of symplectic groups,J. Algebra, 667 (2025), 425–479

2025
[8]

Conway, R.T

J.H. Conway, R.T. Curtis, S.P. Noton, R.A. Parker and R.A. Wilson,Atlas of finite groups, Max- imal subgroups and ordinary characters for simple groups. With computational assistance from J. G. Thackray. Oxford University Press, Eynsham (1985), xxxiv+252 pp

1985
[9]

N. Gill, M. Giudici and P. Spiga, A generalization of Szep’s conjecture for almost simple groups, Vietnam J. Math., 52 (2024), no. 2, 325–359

2024
[10]

Giudici, C.H

M. Giudici, C.H. Li and B. Xia, An infinite family of vertex-primitive 2-arc-transitive digraphs, J. Combin. Theory Ser. B, 127 (2017), 1–13

2017
[11]

Giudici and B

M. Giudici and B. Xia, Vertex-quasiprimitive 2-arc-transitive digraphs,Ars Math. Contemp., 14 (2018), no. 1, 67–82

2018
[12]

Giudici, C.H

M. Giudici, C.H. Li and B. Xia, Vertex-primitives-arc-transitive digraphs of linear groups,J. Pure Appl. Algebra, 223 (2019), no. 12, 5455–5483

2019
[13]

Hering, M.W

C. Hering, M.W. Liebeck and J. Saxl, The factorizations of the finite exceptional groups of Lie type, J. Algebra, 106 (1987), no. 2, 517–527

1987
[14]

Kantor, k-homogeneous groups,Math

W.M. Kantor, k-homogeneous groups,Math. Z., 124 (1972), 261–265

1972
[15]

Kleidman and M.W

P.B. Kleidman and M.W. Liebeck,The Subgroup Structure of the Finite Classical Groups, London Math. Soc. Lecture Note Ser., 129, Cambridge University Press, Cambridge (1990), x+303 pp

1990
[16]

C.H. Li, L. Wang and B. Xia, The factorizations of finite classical groups, arXiv:https://arxiv.org/abs/2402.18373

work page arXiv
[17]

Li and B

C.H. Li and B. Xia, Factorizations of almost simple groups with a factor having many nonsolvable composition factors,J. Algebra, 528 (2019), 439–473

2019
[18]

Li and B

C.H. Li and B. Xia, Factorizations of almost simple groups with a solvable factor, and Cayley graphs of solvable groups,Mem. Amer. Math. Soc., 279 (2022), no. 1375, v+99 pp

2022
[19]

Liebeck, C.E

M.W. Liebeck, C.E. Praeger and J. Saxl, A classification of the maximal subgroups of the finite alternating and symmetric groups,J. Algebra, 111 (1987), no. 2, 365–383

1987
[20]

Liebeck, C.E

M.W. Liebeck, C.E. Praeger and J. Saxl, On the O’Nan-Scott theorem for finite primitive permuta- tion groups,J. Austral. Math. Soc. Ser. A, 44 (1988), no. 3, 389–396

1988
[21]

Liebeck, C.E

M.W. Liebeck, C.E. Praeger and J. Saxl, The maximal factorizations of the finite simple groups and their automorphism groups,Mem. Amer. Math. Soc., 86 (1990), no. 432, iv+151 pp

1990
[22]

Liebeck, C.E

M.W. Liebeck, C.E. Praeger and J. Saxl, On factorizations of almost simple groups,J. Algebra, 185 (1996), no. 2, 409–419

1996
[23]

Liebeck, C.E

M.W. Liebeck, C.E. Praeger and J. Saxl, Transitive subgroups of primitive permutation groups, J. Algebra, 234 (2000), no. 2, 291–361

2000
[24]

Liebeck, C.E

M.W. Liebeck, C.E. Praeger and J. Saxl, Regular subgroups of primitive permutation groups, Mem. Amer. Math. Soc., 203 (2010), no. 952, vi+74 pp

2010
[25]

McKay and C.E

B.D. McKay and C.E. Praeger, Vertex-transitive graphs which are not Cayley graphs, I,J. Aus- tral. Math. Soc. Ser. A, 56 (1994), no. 1, 53–63

1994
[26]

Morris and P

J. Morris and P. Spiga, Asymptotic enumeration of Cayley digraphs,Israel J. Math., 242 (2021), no. 1, 401–459

2021
[27]

Praeger, Highly arc transitive digraphs,European J

C.E. Praeger, Highly arc transitive digraphs,European J. Combin., 10 (1989), no. 3, 281–292

1989
[28]

Praeger and C

C.E. Praeger and C. Schneider,Permutation groups and Cartesian decompositions, London Math. Soc. Lecture Note Ser., 449, Cambridge University Press, Cambridge (2018), xiii+323 pp. 14 J.J. LI, Y.T. SHI, Y. W ANG, AND B. XIA

2018
[29]

J. Pan, C. Wu and F. Yin, Vertex-primitives-arc-transitive digraphs of alternating and symmetric groups,J. Algebra, 544 (2020), 75–91

2020
[30]

Weiss, The nonexistence of 8-transitive graphs,Combinatorica, 1 (1981), no

R. Weiss, The nonexistence of 8-transitive graphs,Combinatorica, 1 (1981), no. 3, 309–311

1981
[31]

Yin and L

F.-G. Yin and L. Chen, Exceptional groups and thes-arc-transitivity of vertex-primitive digraphs, J. Algebra, 694 (2026), 448–483

2026
[32]

Yin, Y.-Q

F.-G. Yin, Y.-Q. Feng and B. Xia, The smallest vertex-primitive 2-arc-transitive digraph,J. Algebra, 626 (2023), 1–38. J.J. Li, School of Mathematics, Center for Applied Mathematics of Guangxi, Guangxi University, Nanning, Guangxi, 530004, P.R.China Email address:lijjhx@gxu.edu.cn Y.T. Shi, Center for Combinatorics and LPMC, Nankai University, Tianjin, 30...

2023