Vertex-primitive s-arc-transitive digraphs of linear groups
Introduction
A digraph Γ is a pair with a set V (of vertices) and an antisymmetric irreflexive binary relation → on V. For a non-negative integer s, an s-arc of Γ is a sequence of vertices with for each . A 1-arc is also simply called an arc. For a subgroup G of , we say Γ is -arc-transitive if G acts transitively on the set of s-arcs of Γ. An -arc-transitive digraph Γ is said to be s-arc-transitive. Note that a vertex-transitive -arc-transitive digraph is necessarily s-arc-transitive. A transitive permutation group G on a set Ω is said to be primitive if G does not preserve any nontrivial partition of Ω. For a subgroup G of , we say Γ is G-vertex-primitive if G is primitive on the vertex set. An -vertex-primitive digraph Γ is said to be vertex-primitive. All digraphs and groups considered in this paper will be finite.
It appears that vertex-primitive s-arc-transitive digraphs with large s are very rare. Indeed, the existence of vertex-primitive 2-arc-transitive digraphs besides directed cycles was only recently determined [8] and no vertex-primitive 3-arc-transitive examples are known. In [9] the authors asked the following question:
Question 1.1 Is there an upper bound on s for vertex-primitive s-arc-transitive digraphs that are not directed cycles?
A group G is said to be almost simple if G has a unique minimal normal subgroup T and T is a nonabelian simple group. These are precisely the groups lying between a nonabelian simple group T and its automorphism group . A systematic investigation of the O'Nan-Scott types of primitive groups has reduced Question 1.1 to almost simple groups by showing that an upper bound on s for vertex-primitive s-arc-transitive digraphs Γ with almost simple will be an upper bound on s for all vertex-primitive s-arc-transitive digraphs [9, Corollary 1.6]. This paper provides the first step in determining such an upper bound by studying vertex-primitive s-arc-transitive digraphs whose automorphism group is an almost simple linear group. Our main result is as follows.
Theorem 1.2 Let Γ be a G-vertex-primitive -arc-transitive digraph, where G is almost simple with socle . Then .
We remark that an infinite family of G-vertex-primitive -arc-transitive digraphs with for each prime such that was constructed in [8]. These digraphs have vertex stabilizer and arc-stabilizer , and are the only known examples of G-vertex-primitive -arc-transitive digraphs such that G is almost simple. A complete classification of G-vertex-primitive -arc-transitive digraphs for almost simple groups G, even for those with , seems out of reach at this stage, though would be achievable for small values of n.
Note that if then either or G has an index 2 subgroup contained in and G contains an element that acts on the projective space associated with G by interchanging the set of 1-spaces and the set of hyperplanes. For any G-vertex-primitive -arc-transitive digraph Γ, the vertex stabilizer for any vertex v of Γ is maximal in G. We prove Theorem 1.2 by analyzing the maximal subgroups of G according to the classes provided by Aschbacher's theorem [1]. The classes , , …, are discussed in Sections 4–6, while the remaining class is dealt with in Section 3. We actually prove that there is no G-vertex-primitive -arc-transitive digraph with from classes , …, (Theorem 5.6) though the possibility for an example with from classes , , or remains open. The examples in [8] have from the class . At the end of Section 6 we give a proof of Theorem 1.2.
Section snippets
Notation
For a group X, denote by the socle of X (that is, the product of all minimal normal subgroups of X), the Fitting subgroup of G, the largest soluble normal subgroup of X, and the smallest normal subgroup of X such that is soluble.
For a group X and a prime p, denote by the largest normal p-subgroup of X, and the subgroup of X generated by the elements of order p in X.
For any integer n and prime number p, denote by the p-part of n (that is, the largest
Homogeneous factorizations
From Lemma 2.11 we see that the s-arc-transitivity of digraphs can be characterized by group factorizations. If a group G acts s-arc-transitively on a digraph Γ with and is an s-arc of Γ, then Lemma 2.11 implies that for all . In addition, since G acts i-arc-transitively on Γ, the two factors and are conjugate in G and hence isomorphic. This motivates the following definition:
Definition 3.1 A factorization is called a homogeneous
and -subgroups
Hypothesis 4.1 Let Γ be a G-vertex-primitive -arc-transitive digraph of valency at least 3, where G is almost simple with socle and for some prime p. Take an arc of Γ. Let be an element of L such that and let . Then is a 2-arc in Γ. Let acting naturally on , φ be the projection from X to L, and g be a preimage of under φ.
Under Hypothesis 4.1, if in addition Γ is -arc-transitive, then Lemma 2.12 asserts that Γ is -arc-transitive so that
, , and -subgroups
We recall Hypothesis 4.1 and observe that with and so .
Lemma 5.1 If Hypothesis 4.1 holds then is not a -subgroup of G.
Proof Suppose that Hypothesis 4.1 holds and is a -subgroup of G. Then by [13, Proposition 4.3.6], either n is prime, or is almost simple with socle for some prime divisor r of n. First assume that n is a prime with . If then or , where or respectively, but a Magma [4]
and -subgroups
In this section we need to consider the stronger hypothesis that Γ is -arc-transitive so that we only need to consider the structure of instead of .
Hypothesis 6.1 Let Γ be a G-vertex-primitive -arc-transitive digraph of valency at least 3, where G is almost simple with socle and for some prime p. Then by Lemma 2.12, Γ is -arc-transitive. Take an arc of Γ. Let g to be an element of L such that and let . Then is a 3-arc in Γ.
Under Hypothesis 6.1, it
Acknowledgements
This research was supported by Australian Research Council grant DP150101066. The third author's work on this paper was done when he was a research associate at the University of Western Australia. The second author acknowledges the support of NNSFC grant 11771200. The authors would like to thank the anonymous referee for careful reading and valuable suggestions.
References (20)
- et al.
On classifying all full factorisations and multiple-factorisations of the finite almost simple groups
J. Algebra
(1998) - et al.
The magma algebra system I: the user language
J. Symb. Comput.
(1997) - et al.
An infinite family of vertex-primitive 2-arc-transitive digraphs
J. Comb. Theory, Ser. B
(2017) Subgroups of prime power index in a simple group
J. Algebra
(1983)- et al.
On factorizations of almost simple groups
J. Algebra
(1996) - et al.
Transitive subgroups of primitive permutation groups
J. Algebra
(2000) On the maximal subgroups of the finite classical groups
Invent. Math.
(1984)- et al.
Finite Groups II
(1982) - et al.
The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
(2013) Permutation Groups
(1999)
Cited by (7)
Vertex-primitive s-arc-transitive digraphs admitting a Suzuki or Ree group
2023, European Journal of CombinatoricsThe smallest vertex-primitive 2-arc-transitive digraph
2023, Journal of AlgebraOn edge-primitive 3-arc-transitive graphs
2021, Journal of Combinatorial Theory. Series BCitation Excerpt :The following results allow us to eliminate certain families of maximal subgroups. The first is essentially proved in [9, Lemma 2.14], and we omit the proof. Tutte's 8-cage