Search arXivSearch

arXiv · 2512.17244

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

Abstract

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

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lei Chen, Cheryl Praeger. 2025-12-19. Quasiprimitive and bi-quasiprimitive highly-arc-transitive digraphs and finite simple groups. https://arxiv.org/abs/2512.17244

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO