Abstract
This paper contributes to the classification of flag-transitive symmetric 2- designs with prime. We investigate the structure of flag-transitive, point-quasiprimitive automorphism groups (G) of such 2-designs by applying the classification of quasiprimitive permutation groups. It is shown that the automorphism groups (G) have either an abelian socle or a non-abelian simple socle. Moreover, according to the classification of finite simple groups, we demonstrate that point-quasiprimitivity implies point-primitivity of G, except when the socle of G is .
MSC:
05B05; 05B25; 05E18; 20B25
1. Introduction
A symmetric 2- design consists of a set of v points and a set of k-element subsets of (called blocks), such that every two points are contained in exactly blocks and any two blocks intersect in precisely points. The number of blocks passing through a point is a constant independent of the point’s choice, equaling k for symmetric designs. An automorphism of is a permutation g of , which also satisfies for each . All automorphisms of form a group , called the full automorphism group of . Any subgroup G of is called an automorphism group of . Naturally, G or is said to be point (block, flag)-transitive if G acts transitively on points (blocks, flags), where flags are the incident point-block pairs. Similarly, G is said to be point-primitive (quasiprimitive, imprimitive) if G acts primitively (quasiprimitively, imprimitively) on points.
This paper investigates the structure of flag-transitive, point-quasiprimitive automorphism groups of symmetric 2- designs with prime. In [1], applying the O’Nan–Scott theorem, the first author and Zhou showed that flag-transitive, point-primitive automorphism groups of such symmetric designs have either an abelian socle or a non-abelian simple socle. Alavi et al., in [2], further completed the classification of these designs when the automorphism group has a non-abelian simple socle. In 1993, Praeger established an analog of the O’Nan–Scott theorem for quasiprimitive groups in [3], which implies the possibility of determining the socle of the point-quasiprimitive automorphism group of 2-designs. In [4], Camina and Praeger proved that the line-transitive point-quasiprimitive automorphism group G of a finite linear space (2- design) is of either affine type or almost simple type. Recently, the third author along with Chen and Zhou demonstrated in [5] that this conclusion also holds true for flag-transitive symmetric 2- designs when is smaller than 100. Notably, these works also show that for , there is no symmetric design with prime admitting a flag-transitive, point-quasiprimitive but imprimitive automorphism group G. Inspired by this, the present paper studies the flag-transitive, point-quasiprimitive automorphism group of symmetric 2-designs, under the assumption that is prime, leading to the following theorem:
Theorem 1.
Let be a nontrivial symmetric 2- design with λ prime and G be a flag-transitive, point-quasiprimitive automorphism group of . Then the socle of G must be an abelian group or a non-abelian simple group. Moreover, the point-quasiprimitivity implies point-primitivity in this case, except when the socle of G is .
Remark 1.
- (i)
- As an exception, G is point-quasiprimitive but imprimitive when the socle is , and the point stabilizer, , is contained within the maximal parabolic subgroup , which is the stabilizer of 1-subspaces.
- (ii)
- When G is flag-transitive and point-primitive with a non-abelian simple socle, the classification of symmetric 2-designs with λ prime has been completed, as detailed in [2].
2. Preliminary Results
We first present some arithmetic results on the symmetric 2-designs and their automorphism groups.
Lemma 1.
For a symmetric 2- design, the values of must satisfy the following:
- (i)
- ;
- (ii)
- .
The flag-transitivity of G implies that k divides since the point stabilizer acts transitively on the k blocks containing . Thus, the lemma below is clear.
Lemma 2.
If G is a flag-transitive automorphism group of a symmetric 2- design, then .
The following lemmas concern the reduction of the flag-transitive, point-primitive symmetric 2-designs with some special values of .
Lemma 3.
([6]). If G is a flag-transitive automorphism group of a symmetric 2-design with , and T is a minimal normal subgroup of G, then T is either abelian or simple with .
Lemma 4.
[1]) If is a symmetric 2- design with λ prime, and is flag-transitive and point-primitive, then the socle of G is either an abelian group or a non-abelian simple group.
Lemma 5.
([5]) If is a symmetric 2- design with , and is flag-transitive and point-quasiprimitive, then the socle of G is either an abelian group or a non-abelian simple group. Moreover, if G is point-quasiprimitive but imprimitive, then the value of λ () cannot be a prime.
For a finite simple group T, the notation denotes the outer automorphism group of T, and denotes the minimal degree of permutation representation of T. The following lemma pertains to the finite simple groups of Lie type, which is simple but necessary for our following discussion.
Lemma 6.
For a finite group T, let be a prime divisor of . Then we have
- (i)
- If T is a simple group of Lie type over the field , then and ;
- (ii)
- If T is a classical simple group of dimension n, then for 10;
- (iii)
- If T is a finite exceptional simple group of Lie type, then , except when T is with or T is with .
Proof.
The lemma follows immediately from ([7] Tables 5.1.A–5.1.C, 5.2.A, Corollary 5.2.3, and [8] Table 4), with some routine arithmetic. Here, we use as an example. When T is , we know that , or with from ([7] Table 5.1 B), and from ([8] Table 4). Therefore, , so (i) and (iii) are clear. □
3. Proof of Theorem 1
From Lemmas 3 and 4, Theorem 1 holds when G is point-primitive or when . Therefore, we need to only consider the case when G is point-quasiprimitive but imprimitive and is a prime divisor of k. In addition, we assume that since the flag-transitive, point-imprimitive symmetric 2-designs with have already been discussed in [9]. To summarize, we propose the following hypothesis for the rest of our discussion.
Hypothesis 1 (H1).
Let be a symmetric 2- design, where λ is a prime divisor of k, and let G be an automorphism group of . Assume that G is flag-transitive and point-quasiprimitive, but point-imprimitive.
Since the automorphism group G acts imprimitively on , there exists a nontrivial partition
of with . Obviously, By the flag transitivity of G, the size of the intersection of a design block B and the imprimitive block is a constant, say ℓ. Now, for a given point , counting the number of flags , such that are in the same imprimitive block and incident with the same block, we arrive at the following equation:
As a result, the following lemmas are immediate:
Lemma 7.
Assume that and G satisfy Hypothesis 1, then .
Proof.
Equation (1) gives , which, together with , yields . Clearly, the left is a positive integer, so . Also, from Hypothesis 1, we have . □
Lemma 8.
Assume that and G satisfy Hypothesis 1, then there exists a maximal subgroup M of G, such that
- (i)
- ;
- (ii)
- when G is almost simple with socle T.
Proof.
Since G is point-imprimitive, there exists a maximal subgroup M of G, such that , where . Moreover, for any partition of , the point-transitivity of G implies . Hence, divides , and so (i) holds by Lemma 7. If G has a non-abelian simple socle T, then and (ii) holds. □
Lemma 9.
Assume that and G satisfy Hypothesis 1, then λ divides . Furthermore, λ divides , where T is the simple socle of G.
Proof.
Since is a prime divisor of k, then the flag-transitivity of G indicates that divides . If divides , then we have by Lemma 8, which contradicts Lemma 6. Hence, divides by . □
3.1. The Abelian Socle or Simple Socle of G
Here, we assume that the flag-transitive automorphism group G is point-quasiprimitive. An analog of the O’Nan–Scott theorem for quasiprimitive groups has been established by Praeger, who showed that each quasiprimitive group is permutationally equivalent to one of the following eight types: the (i) Holomorph affine type, (ii) holomorph simple type, (iii) holomorph compound type, (iv) almost simple type, (v) twisted wreath type, (vi) simple diagonal type, (vii) compound diagonal type, and (viii) product action type. See [3,10] for more details. In this section, our objective is to prove the following result based on the classification of quasiprimitive permutation groups.
Proposition 1.
Assume that and G satisfy Hypothesis 1, then G is of holomorph affine type or almost simple type.
Proof.
If G is of holomorph simple type or holomorph compound type, then G is primitive and the proposition holds by Lemma 4.
Assume that G is of twisted wreath product type, then with and the point stabilizer is embedded into with . Since divides , we have . However, Lemma 1(ii) and Lemma 7 give , which is impossible.
Assume that G is of simple diagonal type, then we have
and with . Moreover, implies or . The former is impossible by Lemma 1(ii) and Lemma 7. For the latter, it implies , which is also impossible when .
Clearly, G cannot be of the compound diagonal type.
Assume that G is of product action type, then there exists a G-invariant partition of , such that the blocks of are of size c. Then can be identified with the Cartesian power of a set with size , such that G acts on as a subgroup of the wreath product in product action, where H is a quasiprimitive group on with a non-abelian simple socle T. Obviously, we have . Moreover, from Lemma 8, there is
Since is a prime divisor of , we have or . The former implies , which is impossible. For the latter, we have by Lemma 8, and it follows that , contradicting Lemma 6.
To summarize, G is of holomorph affine type or almost simple type. □
3.2. The Primitivity of G
By Proposition 1, we know that the socle T of G is a non-abelian simple group or an abelian group. When T is abelian, the quasiprimitive group G is primitive. Hence, we need only to consider the case where T is a non-abelian simple group. In the following, for all cases, except for one possibility of T, we show that no maximal subgroup of G satisfies and , so that the flag-transitive, point-quasiprimitive automorphism group G must be primitive by Lemma 8.
Lemma 10.
Assume that and G satisfy Hypothesis 1, then the socle of G cannot be an alternating group .
Proof.
Assume that the socle T of the point-quasiprimitive G is an alternating group . Then the maximal subgroups M of G are known in [11]. We prove that no maximal subgroup M satisfies and .
First, assume that the maximal subgroup M is intransitive on . In this case, M is isomorphic to with and . Since and , we have and, hence, . However, by , we have , which is impossible for . Then, assume that M is transitive but imprimitive on . In this case, M is isomorphic to , with , and . Obviously, . Moreover, since we know that . If , then which induces . If , . However, both cases are ruled out by Lemma 5. Lastly, assume that M is primitive on . Since , then by ([12] Theorem 14.2), we have
which implies , and this can also be ruled out by Lemma 5. □
Lemma 11.
Assume that and G satisfy Hypothesis 1, then the socle of G cannot be a Sporadic group.
Proof.
If the socle of G is a Sporadic group, then by , we have . The conclusion follows immediately from Lemma 5. □
Lemma 12.
Assume that and G satisfy Hypothesis 1, then the socle of G cannot be a simple exceptional group of Lie type.
Proof.
Assume that G is point-imprimitive and the socle T is a simple exceptional group of Lie type. Then the facts and , together with Lemma 6, imply that T is with , or with .
If T is , from [13], we know that the order is either , , , or with , and i is odd, where . Since , we have . However, for all cases, except , the prime divisors of are smaller than . When , we have and , which contradicts .
If T is with , then . From ([14] Lemma 3.3), we know that the order is either , , , , or with and an odd i, where . However, the fact that forces for all cases, which is contradictory to . □
In what follows, we will handle the case when T is a classical simple group. Herein, we adopt the notation of [7]. For example, , , , and denote the linear, symplectic, unitary, and orthogonal groups on finite vector spaces of dimension n, respectively. The key tool used here is the well-known Aschbacher theorem, which divides the maximal subgroups of classical groups into nine classes. Roughly speaking, the first eight classes consist of subgroups that preserve some kind of geometric structure, while the ninth class consists of subgroups that are not of geometric type—that are almost simple, taking into account the subgroup of scalar matrices on a modulo basis. For more detail, see [15].
We first deal with the case where the maximal subgroup M is almost simple.
Lemma 13.
Assume that and G satisfy Hypothesis 1. If the socle T of G consists of classical simple groups of dimension n, then the maximal subgroup M of G cannot be almost simple.
Proof.
Assuming that M is an almost simple irreducible subgroup with socle , then ([16] Theorem 4.1) shows that either is an alternating group with , or . If the former holds, then . For , Lemmas 6 and 8 imply
which is a contradiction. For , it can also be ruled out by Lemma 5. Therefore, the latter case must hold, where . For this case, when T is or , we have by ([17] Corollary 4.3) and by . These, together with , imply . It follows that and all possibilities of M are listed in ([18] Section 8.2). Since , one can easily find that for all possibilities of M, which is ruled out by Lemma 5. When T is the remaining classical simple group, the fact implies , and so . Moreover, from ([17] Corollary 4.3), we have . This, together with , implies . However, from ([18] Section 8.2), we find that or for all possibilities of M, which contradicts Lemma 5. □
Next, we address the cases where M is of geometric type. All possibilities of such an M can be found in ([7] Tables 3.5.A–3.5.F). The discussions below rely heavily on the minimal degree , which is presented in ([7] Table 5.2.A), and ([8] Table 4).
Lemma 14.
Assume that and G satisfy Hypothesis 1. If the socle T of G is with , then the point stabilizer is contained in the maximal parabolic subgroup.
Proof.
Suppose that T is with . Then we know that
from ([8] Table 4). All possibilities of subgroup M are listed in ([7] Table 3.5.A), and will be discussed case-by-case in the following.
(1) If M is of type , the maximal parabolic subgroup, then
and since . So, by Lemma 8, we have
which implies . Hence, M is of type , the stabilizer of 1-subspaces of G. If M is of type with , then
and . By , we have , which is impossible for any . If M is of type with , then
By , we have for and for . However, both cases contradict .
(2) Assume that M is of type with . We first consider the case . In this case, , which implies or . However, the condition implies for and for . The former is impossible and the latter forces . For , we have and , which contradicts . Now, we assume that . In this case, , which implies , which is, again, a contradiction.
(3) Assume that M is of type with i prime. If , then and . However, inequality holds only when . Note that i is a prime, so and . It follows that , which contradicts Lemma 8. When , we have and . So, by , which is impossible.
(4) If M is of type with , then , too small to satisfy .
(5) If M is of type , where , and i is a prime, then , which is too small to satisfy .
(6) If M is of type , where , and is a prime divisor of , then , and it is too small to satisfy Lemma 8 when . If M is and , then , and is too small, since . If , then , which has already been ruled out by Lemma 5.
(7) If M is of type , a tensor product subgroup, with and , then , which is also too small to satisfy .
(8) If M is of type with n being even, then and . However, holds only when . For , and , which implies , which is a contradiction. If M is of type , with q being odd and being even, then , where and . However, , which is impossible. If M is of type , where , and q is odd, then and . It follows that , which is also impossible. If M is of type , with , then and . We can easily find that is too small to satisfy .
In conclusion, when T is , the only possible maximal subgroup containing is , which is the maximal parabolic subgroup. □
Lemma 15.
Assume that and G satisfy Hypothesis 1, then the socle T of G cannot be with .
Proof.
Assume that T is with . If , or (the exceptional cases will be discussed later), from ([8] Table 4), we have
Moreover, the facts and imply
Similar to the above discussion, we will check all possibilities of M on a case-by-case basis, as listed by ([7] Table 3.5.B), and show that none satisfy .
(1) If M is of type with , then since divides , is a prime divisor of or . By (4), the former is impossible, and the latter implies . This inequality leads to , which is a contradiction. In the case when M is of type with , we have , which contradicts (4).
(2) Assume that M is of type , where . If , then or , and (4) cannot hold. If , then , and is too small to satisfy . If M is of type with n being even, then , which implies that is too small to satisfy .
(4) The case when M is of type with and is impossible by .
(5) The case when M is of type with (i an odd prime) is impossible; otherwise, , which contradicts (4). If M is of type with being odd, then , which is a contradiction. If M is of type , where q is odd, and n is even or of type , with n being even, then we have , which implies . However, when , gives , which is a contradiction.
(6) Assume that M is of type , where , and is a prime. If is an odd prime, then n is odd; thus, , which is a contradiction. For the case where , and M is of type , where , we have . Note that , so , and , which is impossible.
(7) If M is of type , a tensor product subgroup, where with and , then , which is contrary to (4).
Now, we consider the remaining cases, where , , or , with being even. For , T is , and we have . Note that ; thus, , which is contrary to . If T is with , then and imply that and . It contradicts . We assume that T is with being even. Then, . Since , , this implies that cannot be satisfied. □
Lemma 16.
Assume that and G satisfy Hypothesis 1, then the socle T of G cannot be with .
Proof.
Assume that T is with . If , then from ([8] Table 4), we have
Moreover, the facts that and yield the following:
We discuss each maximal subgroup case M of G in turn, as listed in ([7] Table 3.5.C), and show that none satisfy .
(1) If M is of type , with , then is a prime divisor of or . This implies that or , respectively, and both cases contradict (5) since . If M is of type with , then is a prime divisor of or . It follows that , which is a contradiction.
(2) If M is of type , where , then . If M is of type with q being odd, then . If M is of type , where , and q is even, then . For all cases, is too small to satisfy (5).
(3) Assume that M is of type with j prime and . If , then and . However, the inequality cannot be satisfied. If j is an odd prime, then , which is a contradiction. If M is of type with q being odd, then , which is a contradiction.
(4) If M is of type with , then we obtain a contradiction by
(6) If M is of type with and , then holds only when . It follows that , which can be ruled out by Lemma 5.
(7) If M is of type , where , and is odd, then , which is a contradiction.
(8) If M is of type with q being even, then , which is a contradiction. If M is of type with q being even, then . Moreover, the facts that and imply that . If , then and , contradicting . Thus, we have Note that . If , then by , we have , which is impossible. Therefore, and . This implies and , contradicting in Lemma 7.
We now consider the case when T is . We have and . If , then . The facts that and imply , resulting in a contradiction. Hence, , and , which is contrary to . □
Lemma 17.
Assume that and G satisfy Hypothesis 1, then the socle T of G cannot be with .
Proof.
Suppose that T is . Note that , so we have . If , then from ([8] Table 4), we have
Moreover, considering the facts that and , we obtain
The maximal subgroups M of G are listed in ([7] Table 3.5.D), we will discuss them case-by-case.
(1) If M is of type with , then is a prime divisor of or . It follows that
a contradiction. Assume that M is of type , where i is odd and , it follows that , and i is an odd force . If is a prime divisor of , then , and is too small to satisfy (6). If is a prime divisor of , then , and is too small again. If is a prime divisor of , then , which implies that . When , and the type of M is , we have . Since , and q is odd, , and cannot be satisfied.
(2) If M is of type with and being odd, then . If M is of type with , then when . Both cases imply that is too small to satisfy (6).
(3) Assume that M is of type , where , and i is an odd prime. Obviously, j is odd. Then , which is contrary to .
(4) If M is of type with and , then , which is contrary to .
(5) If M is of type with and i is a prime, then , which is contrary to .
(6) If M is of type with , and i is odd, then , and is too small.
We now consider the case where T is , when . In this case, and . It follows that , which contradicts . □
Lemma 18.
Assume that and G satisfy Hypothesis 1, then the socle T of G cannot be with .
Proof.
Suppose that T is with . Note that , so we have . Then, from ([8] Table 4), we know that
Furthermore, considering and , we have
We will discuss all types of M on a case-by-case basis, as listed in ([7] Table 3.5.F).
(1) If M is of type with , then is a prime divisor of or . It follows that or . If M is of type , with when i is even and when i is odd, then since , we have when i is even and when i is odd. If M is of type with q being even, then . Both cases contradict (7).
(2) If M is of type with i being even and , then , which is a contradiction. If M is of type with i being odd and , then , which is a contradiction. If M is of type with , then , which is impossible when . If M is of type and is odd, then ; this is a contradiction.
Lemma 19.
Assume that and G satisfy Hypothesis 1, then the socle of G cannot be with .
Proof.
Assume that T is with . If , then from ([8] Table 4), we have
Moreover, since is a prime divisor of , we have , which contradicts . If , we have and , which contradicts . For , we have and , which is a contradiction again. Therefore, the socle of G cannot be with . □
Proposition 2.
Assume that and G satisfy Hypothesis 1. If the socle T of G is a non-abelian simple group, then T must be .
Proof.
For Lemmas 10–19, we draw a conclusion. □
Proof of Theorem 1.
It follows immediately from Propositions 1 and 2. □
Author Contributions
Data Curation, Z.Z. and Y.Z.; writing—original draft, J.S.; writing—review and editing, Y.Z. All authors have read and agreed to the published version of the manuscript.
Funding
This work was funded by the National Natural Science Foundation of China (grant numbers: 12301020, 12201469, and 12001204) and Science and Technology projects in Guangzhou (grant numbers: 2023A04J0027 and 2023A04J0009).
Data Availability Statement
Data are contained within the article.
Acknowledgments
The authors would like to thank the anonymous reviewers for the many comments and constructive suggestions.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Zhang, Y.; Zhang, Z.; Zhou, S. Reduction for primitive flag-transitive symmetric 2-(v,k,λ) designs with λ prime. Discret. Math. 2020, 343, 111843. [Google Scholar] [CrossRef]
- Alavi, S.; Daneshkhah, A.; Bayat, M. Almost simple groups as flag-transitive automorphism groups of symmetric designs with λ prime. ARS. Math. Contemp. 2023, 23, 3–10. [Google Scholar] [CrossRef]
- Praeger, C. An O’Nan-Scott theorem for finite quasiprimitive permutation groups and an application to 2-arc transitive graphs. J. Lond. Math. Soc. 1993, 47, 227–239. [Google Scholar] [CrossRef]
- Camina, A.; Praeger, C. Line-transitive, point quasiprimitive automorphism groups of finite linear spaces are affine or almost simple. Aequ. Math. 2021, 61, 221–232. [Google Scholar] [CrossRef]
- Zhang, Z.; Chen, J.; Zhou, S. On symmetric designs with flag-transitive and point-quasiprimitive automorphism groups. J. Combin. Des. 2023. [Google Scholar] [CrossRef]
- Zieschang, P. Flag transitive automorphism groups of 2-designs with (r,λ)=1. J. Algebra 1988, 118, 265–275. [Google Scholar] [CrossRef]
- Kleidman, P.; Liebeck, M. The Subgroup Structure of the Finite Classical Groups; Cambridge University Press: Cambridge, UK, 1990. [Google Scholar]
- Guest, S.; Morris, J.; Praeger, C.; Spiga, P. On the maximum orders of elements of finite almost simple groups and primitive permutation groups. Trans. Amer. Math. Soc. 2015, 367, 7665–7694. [Google Scholar] [CrossRef]
- Montinaro, A. The symmetric 2-(v,k,λ) designs, with , admitting a flag transitive, point imprimitive automorphism group are known. arXiv 2023, arXiv:2212.08893. [Google Scholar]
- Praeger, C. Quasiprimitivity: Structure and combinatorial applications. Discret. Math. 2003, 264, 211–224. [Google Scholar] [CrossRef]
- Liebeck, M.; Praeger, C.; Saxl, J. A classification of the maximal subgroups of the finite alternating and symmetric groups. J. Algebra 1987, 111, 365–383. [Google Scholar] [CrossRef]
- Wielandt, H. Finite Permutation Groups; Academic Press: Cambridge, MA, USA, 1964. [Google Scholar]
- Suzuki, M. On a class of doubly transitive groups. Ann. Math. 1962, 75, 105–145. [Google Scholar] [CrossRef]
- Kleidman, P. The maximal subgroups of the Chevalley groups G2(q) with q odd, the Ree groups 2G2(q), and their automorphism groups. J. Algebra 1998, 117, 30–71. [Google Scholar] [CrossRef]
- Aschbacher, M. On the maximal subgroups of the finite classical groups. Invent. Math. 1984, 76, 469–514. [Google Scholar] [CrossRef]
- Liebeck, M. On the orders of maximal subgroups of the finite classical groups. Proc. Lond. Math. Soc. 1985, 50, 426–446. [Google Scholar] [CrossRef]
- Alavi, S.; Burness, T. Large subgroups of simple groups. J. Algebra 2015, 421, 187–233. [Google Scholar] [CrossRef]
- Bray, J.; Holt, D.; Roney-Dougal, C. The Maximal Subgroups of the Low-Dimensional Finite Classical Groups; Cambridge University Press: Cambridge, UK, 2013. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).