English

Quasiprimitive and bi-quasiprimitive highly-arc-transitive digraphs and finite simple groups

Combinatorics 2025-12-22 v1

Abstract

We extend the notion of an HH-normal quotient digraph of an HH-vertex-transitive digraph to that of an HH-subnormal quotient digraph. Using these concepts, together with bipartite halves of bipartite digraphs, we show that, for each finite connected HH-vertex-transitive, (H,s)(H,s)-arc-transitive digraph with s6s\geqslant6, either some HH-normal quotient is a directed cycle of length at least 33, or there is an (L,t)(L,t)-arc-transitive digraph with t(s3)/2t\geqslant (s-3)/2, and LL a vertex-quasiprimitive almost simple group with socle a composition factor of HH. This connection demonstrates that, to understand finite ss-arc-transitive digraphs with large ss, those admitting a vertex-quasiprimitive almost simple ss-arc-transitive subgroup of automorphisms play a central role. We show that for each ss and each odd valency kk, there are infinitely many (H,s)(H,s)-arc-transitive digraphs of valency kk with HH a finite alternating group. In addition we discovered a novel construction which takes as input a connected non-bipartite HH-vertex-transitive, (H,s)(H,s)-arc-transitive digraph, and outputs a connected bipartite GG-vertex-transitive, (G,2s)(G,2s)-arc-transitive digraph with G=(H×H).2G=(H\times H).2. This leads to construction of vertex-bi-quasiprimitive ss-arc-transitive digraphs, for arbitrarily large ss. Our investigations yield several new open problems.

Keywords

Cite

@article{arxiv.2512.17244,
  title  = {Quasiprimitive and bi-quasiprimitive highly-arc-transitive digraphs and finite simple groups},
  author = {Lei Chen and Cheryl Praeger},
  journal= {arXiv preprint arXiv:2512.17244},
  year   = {2025}
}