SearcharxivSearch

arXiv · 2109.10508

Vertex-primitive s-arc-transitive digraphs admitting a Suzuki or Ree group

Abstract

The investigation of s-arc-transitivity of digraphs can be dated back to 1989 when the third author showed that s can be arbitrarily large if the action on vertices is imprimitive. However, the situation is completely different when the digraph is vertex-primitive and not a directed cycle. In 2017 the second author, Li and Xia constructed the first infinite family of G-vertex-primitive 2-arc-transitive examples, and asked if there is an upper bound on s for G-vertex-primitive s-arc-transitive digraphs w=that are not directed. In 2018 the second author and Xia showed that if there is a largest such value of s then it will occur when G is almost simple. So far it has been shown that s\leq 2 for almost simple groups whose socle is an alternating group or a projective special linear group. The contribution of this paper is to prove that s\leq 1 in the case of the Suzuki and the small Ree groups. We give constructions with s=1 to show that the bound is sharp.

Explore related subjects

Keep this discovery

BibTeXRIS

Lei Chen, Michael Giudici, Cheryl E Praeger. 2021-09-22. Vertex-primitive s-arc-transitive digraphs admitting a Suzuki or Ree group. https://arxiv.org/abs/2109.10508

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR