The Orbital Graph of Primitive Group with Socle A7 × A7

Abstract

In this paper, we mainly study the orbital graphs of primitive groups with the socle A7 x Awhich acts by diagonal action. Firstly, we calculate the element conjugate classes of A7, then we discuss the stabilizer of two points in A7. Finally, according to the relation between suborbit and orbital, we obtain the orbitals, and determine the orbital graphs.

Share and Cite:

Wu, J. , Wang, C. , Yang, J. and Xu, H. (2022) The Orbital Graph of Primitive Group with Socle A7 × A7. Advances in Pure Mathematics, 12, 136-143. doi: 10.4236/apm.2022.123012.

1. Introduction

Let G be a primitive group with the socle A 7 × A 7 , and T = A 7 , H = { ( t , t ) | t T } . G acts on Ω = { H x | x A 7 } . The stabilizer of α in G is G α , α G is the orbit of α under G. For any α G , we call the orbit of G α is suborbit of G, and the length of the suborbit is called subdegree. Let G be a group acting transitively on a set Ω. Then G induces a natural action on the Cartesian product Ω × Ω . The orbits of G on this set are called the orbitals of G on Ω. For each orbital Δ, we can denote an orbital Δ , where ( α , β ) Δ if and only if ( β , α ) Δ . We call Δ and Δ are paired orbitals. Clearly, ( Δ ) = Δ . An orbital Δ is called self-paired if Δ = Δ .

There is a close relationship between the orbitals of G and the orbits of G α . For each orbital Δ of G and each α Ω , we define Δ ( α ) : = { β Ω | ( α , β ) Δ } which is the set of points which are in the same orbit with α under G α . It is easy to verify that the mapping Δ Δ ( α ) is a bijection from the set of orbitals of G onto the set of orbits of G α with the diagonal orbital mapping onto the trivial orbit { α } . In particular, the number of orbits is equal to the number of orbits of G α , this number is called the rank of G.

Usually, we depart graphs into two types: directed graph (digraph) and undirected graph. A digraph Γ is a paired ( V , E ) , where E is a subset of V × V . V represents the vertex set and E represents the edge set. If ( α , β ) E whenever ( β , α ) E , then the digraph is called undirected. For a given orbital, there is an induced orbital graph. We see the elements of Ω as vertices and the orbital Δ of G as edge, then we will obtain a diagraph Graph (Δ). Obviously, the action of G on Graph (Δ) induces an arc-transitive action. Further, if Δ is self-paired, then the corresponding graph is an undirected arc-transitive graph.

There are many papers which refer to the suborbits of primitive group. In 1964, Wielandt’s book referred that if G is a finite primitive group with a suborbit of length 2, then G is a dihedral group of order 2q (q prime) [1]. In 1967, Wong successively determined all primitive groups with a suborbit of length 3 and length 4 [2]. About the orbital, Quirin studied the primitive permutation groups with small orbitals in 1971 [3]. Later, Liebeck and Saxl determined the finite primitive permutation groups of rank three in 1986 [4], and on point stabilizers in primitive permutation groups in 1991 [5]. In 2004, Li, Lu and Marušič gave a complete classification of primitive permutation groups with small suborbits [6], they also determined the orbital graphs of such groups, in particular, for the valency 3 and 4. In the book [7], Xu proved that the diagonal subgroup of T × T , where T is a nonabelian simple group, is the unique maximal subgroup in T × T . He also calculated the lengths of the suborbits of A 5 × A 5 . In 2014, the author has analyzed the orbitals of primitive group with socle A 6 × A 6 by SD action and PA action [8]. In 2017, doctor Wu Cixuan discussed the orbital graphs of finite permutation groups and their relevant edge-transitive graphs [9].

Here we just discuss the primitive group with SD type. According to the classification of finite simple group and the O’Nan-Scott theorem, we acquire the following theorem.

Theorem 1.1 Let G = A 7 × A 7 , H = { ( t , t ) | t A 7 } , A 7 H G . Consider the right multiplicative action of G on Ω = [ G : H ] . Then the information of the orbitals of G on Ω is listed in the following table:

where in the table, K i represents the stabilizer of the point stabilizer H on an orbit; l i represents the length of suborbit;

Because the order of A 7 is 2520, which is a little large. Also the number of subgroups of A 7 is more than A 5 and A 6 and the structure of subgroup is very complex. So discuss the orbital graph of A 7 × A 7 is a challenge job. In this paper, we depart the elements of A 7 by conjugation in Lemma 3.1 firstly, and determine the length of suborbits, then we obtain the stabilizers of two points in A 7 in Lemma 3.2. Last, we determine the orbital by Lemma 2.4 and obtain the final result. Besides, the method has advantage for the discussion of some complex group, and based on the result of this paper, we can discuss the structure of orbital graph further.

2. Basic Concepts of Permutation Groups

In this paper, about the primitive groups and orbit, we need know the theorems as following.

Lemma 2.1 Let G be a group, a G , then the number of the conjugated elements of a in G is | G : N G ( a ) | .

Lemma 2.2 [7] Let T be a non-abelian simple group, G = T × T . Let H = { ( t , t ) | t T } . Then H is maximal subgroup of G, and so the action of G on the set Ω = [ G : H ] is primitive.

Lemma 2.3 [7] Let G = T × T , and T be a nonabelian simple group. Let H = { ( t , t ) | t T } and G act primitively on the set Ω of right cosets of H in G. Then the length of suborbit equals to the length of conjugated class in T.

Lemma 2.4 [6] Let G be a group acting transitively on a set Ω, Δ be an orbital of G on Ω, and ( α , β ) Δ . Then Δ is self-paired if and only if there exists g G such that ( α , β ) g = ( β , α ) . In this case, we have g 2 G α , g N G ( G α β ) \ G α . In particular, | N G ( G α β ) : G α β | is even.

3. The Orbital Graphs of Primitive Group with Socle A7 × A7

According to the Latex, we know the maximal subgroups of A 7 are A 6 , L 2 ( 7 ) A , L 2 ( 7 ) B , S 5 , ( A 4 × Z 3 ) : Z 2 , so we can know all subgroups of A 7 . Here we just discuss the suborbits of G with SD type. Firstly, we give the calculation of the suborbits of G with SD type.

Lemma 3.1 Let T = A 7 . Dividing the elements in A 7 by conjugation, then we have the following result:

1) The element (1) forms a conjugate class, denote it by C 1 , then C 1 = ( 1 ) ;

2) The elements of type ( 12 ) ( 34 ) form a conjugate class, denote it by C 2 . Then C 2 = ( 12 ) ( 34 ) A 7 , and the length is 105;

3) The elements of type ( 123 ) form a conjugate class, denoted it by C 3 . Then C 3 = ( 123 ) A 7 , and the length is 70;

4) The elements of type ( 123 ) ( 456 ) form a conjugate class, denoted it by C 4 . Then C 4 = ( 123 ) ( 456 ) A 7 , and the length is 280;

5) The elements of type ( 12 ) ( 3456 ) form a conjugate class, denoted it by C 5 . Then C 5 = ( 12 ) ( 3456 ) A 7 , and the length is 630;

6) The elements of type ( 123 ) ( 45 ) ( 67 ) form a conjugate class, denoted it by C 6 . Then C 6 = ( 123 ) ( 45 ) ( 67 ) A 7 , and the length is 210;

7) The elements of type ( 12345 ) form a conjugate class, denoted it by C 7 . Then C 7 = ( 12345 ) A 7 , and the length is 504;

8) The elements of type ( 1234567 ) form two conjugate classes, denoted them by C 8 and C 9 . Then C 8 = ( 1234567 ) A 7 and the length is 360; C 9 = ( 1234576 ) A 7 and the length also is 360.

Proof. C 1 = ( 1 ) , obviously, | C 1 | = 1 . For C 2 = ( 12 ) ( 34 ) A 7 , since ( 12 ) ( 34 ) = ( 21 ) ( 43 ) and for arbitrary two elements α , β , there exist c A 7 such that α c = β , so | C 2 | = A 7 2 2 × A 5 2 2 2 = 105 .

Similar, for C 3 = ( 123 ) A 7 , | C 3 | = A 7 3 3 = 70 .

For C 4 = ( 123 ) ( 456 ) A 7 , | C 4 | = A 7 3 3 × A 4 3 3 2 = 280 .

For C 5 = ( 12 ) ( 3456 ) A 7 , | C 5 | = A 7 2 2 × A 5 4 4 = 630 .

For C 6 = ( 123 ) ( 45 ) ( 67 ) A 7 , | C 6 | = A 7 3 3 × A 4 2 2 × A 2 2 2 2 = 210 .

For C 7 = ( 12345 ) A 7 , | C 7 | = A 7 5 5 = 504 .

Because ( 1234567 ) × ( 67 ) = ( 1234576 ) , but ( 67 ) does not belong in A 7 , so they form two different conjugate classes.

For C 8 = ( 1234567 ) A 7 , | C 8 | = A 7 7 7 = 360 .

For C 9 = ( 1234576 ) A 7 , | C 9 | = A 7 7 7 = 360 .

According to Lemma 2.3, the length of suborbits of A 7 × A 7 acts on [ G : H ] are 1, 105, 70, 280, 630, 210, 504, 360 and 360. We denote them by l 1 , l 2 , l 3 , l 4 , l 5 , l 6 , l 7 , l 8 , l 9 .

Now we calculate the order of two-point stabilizer. Let G = A 7 × A 7 acts primitively on Ω = { H x | x A 7 } , where H = { ( t , t ) | t T = A 7 } . G α H is the stabilizer of α in G. For arbitrary β Ω , by Lemma 2.3, | β G α | = | G α : G α β | = | H : G α β | = | T : N T ( t ) | . Then | G α β | = | G α | | β G α | = | T | | C i | = | N T ( t i ) | . So let T = A 6 acts on Δ = { t | t A 6 } by conjugation, then:

1) If t 1 = ( 1 ) , then | G α β 1 | = | N T ( t 1 ) | = 2520 1 = 2520 ;

2) If t 2 = ( 12 ) ( 34 ) , then | G α β 2 | = | N T ( t 2 ) | = 2520 105 = 24 ;

3) If t 3 = ( 123 ) , then | G α β 3 | = | N T ( t 3 ) | = 2520 70 = 36 ;

4) If t 4 = ( 123 ) ( 456 ) , then | G α β 4 | = | N T ( t 4 ) | = 2520 280 = 9 ;

5) If t 5 = ( 12 ) ( 3456 ) , then | G α β 5 | = | N T ( t 5 ) | = 2520 630 = 4 ;

6) If t 6 = ( 123 ) ( 45 ) ( 67 ) , then | G α β 6 | = | N T ( t 6 ) | = 2520 210 = 12 ;

7) If t 7 = ( 12345 ) , then | G α β 7 | = | N T ( t 7 ) | = 2520 504 = 5 ;

8) If t 8 = ( 1234567 ) , then | G α β 8 | = | N T ( t 8 ) | = 2520 360 = 7 ;

9) If t 9 = ( 1234576 ) , then | G α β 9 | = | N T ( t 9 ) | = 2520 360 = 7 .

According to the order of G α β , we can determine the two-point stabilizer subgroups. Then we have the following result:

Lemma 3.2 Let G = A 7 × A 7 , A 7 H = G α , C i ( i = 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 ) be the conjugate class in A 7 . Then:

1) For C 1 = ( 1 ) , there is G α β 1 A 7 ;

2) For C 2 = ( 12 ) ( 34 ) , there is G α β 2 S 4 ;

3) For C 3 = ( 123 ) , there is G α β 3 Z 3 2 × Z 4 ;

4) For C 4 = ( 123 ) ( 456 ) , there is G α β 4 Z 3 × Z 3 ;

5) For C 5 = ( 12 ) ( 3456 ) , there is G α β 5 Z 2 × Z 2 ;

6) For C 6 = ( 123 ) ( 45 ) ( 67 ) , there is G α β 6 A 4 ;

7) For C 7 = ( 12345 ) , there is G α β 7 Z 5 ;

8) For C 8 = ( 1234567 ) , there is G α β 8 Z 7 ;

9) For C 9 = ( 1234576 ) , there is G α β 9 Z 7 .

In order to know the suborbits are self-paired or not, by Lemma 2.4, we need to calculate the N G ( G α β ) . Let G = T × T , H = { ( t , t ) | t T } , K = { ( k , k ) | k K and K T } , then K K H T . Take ( k , k ) K , g = ( x , y ) N G ( K ) ( x , y N T ( K ) = N H ( K ) ) , we have: ( k , k ) ( x , y ) = ( k x , k y ) K . So k x = k y , k x y 1 = k , x y 1 N H ( k ) = C H ( k ) C H ( K ) . There exists c C H ( K ) such that x y 1 = c , x = c y , then g can be described as ( c y , y ) , so N G ( K ) = { ( c y , y ) | c C H ( K ) and y N H ( K ) and | N G ( k ) | = | C H ( K ) | | N H ( K ) | .

Let K = G α β , we have:

1) G α β = A 7 .

Obviously, | N G ( A 7 ) | = | C H ( A 7 ) | | N H ( A 7 ) | = | 1 | | A 7 | = 2520 .

2) G α β = S 4 .

By GAP, we know N H ( S 4 ) = ( A 4 × Z 3 ) : Z 2 , C H ( S 4 ) = Z 3 , so | N G ( S 4 ) | = | C H ( S 4 ) | | N H ( S 4 ) | = | Z 3 | | ( A 4 × Z 3 ) : Z 2 | = 72 .

3) G α β = Z 3 2 × Z 4 .

Because Z 3 2 × Z 4 is the maximal subgroup of A 6 and A 6 is the subgroup of A 7 , N H ( Z 3 2 × Z 4 ) = Z 3 2 × Z 4 . C H ( Z 3 2 × Z 4 ) = Z 3 2 × Z 4 . So: | N G ( Z 3 2 × Z 4 ) | = | C H ( Z 3 2 × Z 4 ) | | N H ( Z 3 2 × Z 4 ) | = | Z 3 2 × Z 4 | | Z 3 2 × Z 4 | = 1296 .

4) G α β = Z 3 × Z 3 .

Because Z 3 × Z 3 ( Z 3 × Z 3 ) : Z 4 and ( Z 3 × Z 3 ) : Z 4 is maximal in A 6 , N H ( Z 3 × Z 3 ) = ( Z 3 × Z 3 ) : Z 4 . And also because Z 2 and Z 4 don’t centralize Z 3 × Z 3 , C H ( Z 3 × Z 3 ) = Z 3 × Z 3 . So: | N G ( Z 3 × Z 3 ) | = | C H ( Z 3 × Z 3 ) | | N H ( Z 3 × Z 3 ) | = | ( Z 3 × Z 3 ) : Z 4 | | Z 3 × Z 3 | = 324 .

5) G α β = Z 2 × Z 2

Because A 4 = ( Z 2 × Z 2 ) : Z 3 , S 4 = A 4 : Z 2 and S 4 is the maximal subgroup of A 6 , A 6 is the maximal subgroup of A 7 , N H ( Z 2 × Z 2 ) = S 4 . And also because Z 3 does not centralize Z 2 × Z 2 , C H ( Z 2 × Z 2 ) = Z 2 × Z 2 . So: | N G ( Z 2 × Z 2 ) | = | C H ( Z 2 × Z 2 ) | | N H ( Z 2 × Z 2 ) | = | S 4 | | Z 2 × Z 2 | = 96 .

6) G α β = A 4

Similar to G α β = S 4 , by GAP, we have N H ( A 4 ) = ( A 4 × Z 3 ) : Z 2 , C H ( A 4 ) = Z 3 , so | N G ( A 4 ) | = | C H ( A 4 ) | | N H ( A 4 ) | = | Z 3 | | ( A 4 × Z 3 ) : Z 2 | = 72 .

7) G α β = Z 5

Because A 5 is simple group, which has no normal subgroup, and the subgroups of A 5 is S 3 , A 4 , D 10 , N H ( Z 5 ) = D 10 , C H ( Z 5 ) = Z 5 . So: | N G ( Z 5 ) | = | C H ( Z 5 ) | | N H ( Z 5 ) | = | | D 10 | | Z 5 | = 50 .

8) G α β = Z 7

Z 7 : Z 3 is a maximal subgroup of L 3 ( 2 ) and L 3 ( 2 ) is a maximal subgroup of A 7 , so N H ( Z 7 ) = Z 7 : Z 3 , C H ( Z 7 ) = Z 7 . So: | N G ( Z 7 ) | = | C H ( Z 7 ) | | N H ( Z 7 ) | = | Z 7 : Z 3 | | Z 7 | = 147 .

In the following paragraph, we will discuss whether suborbits are self-paired or not.

1) For l 1 = 1 , obviously, this suborbit is self-paired.

2) For l 2 = 105 , | N G ( G α β ) : G α β | = 72 24 = 3 , so it is not self-paired.

3) For l 3 = 70 , | N G ( G α β ) : G α β | = 1296 36 = 36 , so it is self-paired.

4) For l 4 = 280 , | N G ( G α β ) : G α β | = 324 9 = 36 , so it is self-paired.

5) For l 5 = 630 , | N G ( G α β ) : G α β | = 96 4 = 24 , so it is self-paired.

6) For l 6 = 210 , | N G ( G α β ) : G α β | = 72 12 = 6 , so it is self-paired.

7) For l 7 = 504 , | N G ( G α β ) : G α β | = 50 5 = 10 , so it is self-paired.

8) For l 8 = 360 , | N G ( G α β ) : G α β | = 147 7 = 21 , so it is not self-paired.

By the discussion above and the relationship between the orbital of G on Ω × Ω and the suborbit of G on Ω, we acquire the following result.

Proposition 3.3 Let G = A 7 × A 7 acts primitively on Ω = { H x | x A 7 × A 7 } , where H = { ( t , t ) | t T } A 7 . Then the following results hold:

1) If the length of suborbit is 1, the corresponding orbital graph is a loop;

2) If the length of suborbit is 105, the corresponding orbital graph is not self-paired, so it is digraph and is also arc-transitive graph;

3) If the length of suborbit is 70, the corresponding orbital graph is self-paired, so it is an undirected arc-transitive graph;

4) If the length of suborbit is 280, the corresponding orbital graph is self-paired, so it is an undirected arc-transitive graph;

5) If the length of suborbit is 630, the corresponding orbital graph is self-paired, so it is an undirected arc-transitive graph;

6) If the length of suborbit is 210, the corresponding orbital graph is self-paired, so it is an undirected arc-transitive graph;

7) If the length of suborbit is 504, the corresponding orbital graph is self-paired, so it is an undirected arc-transitive graph;

8) If the length of suborbit is 360, the corresponding orbital graph is self-paired, so it is digraph and is also arc-transitive graph.

By the discussion above, we can acquire the result which is described in Theorem 1.1.

Funding

The paper is supported by the Science Research Fund of Education Department of Yunnan Provincial (No. 2020J0339).

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Wielandt, H. (1964) Finit Permutation Groups. Academic Press, New York.
[2] Wong, W.J. (1967) Determination of a Class of Primitive Permutation Groups. Mathematische Zeitschrift, 99, 235-246.
https://doi.org/10.1007/BF01112454
[3] Quirin, W.L. (1971) Primitive Permutation Groups with Small Orbitals. Mathematische Zeitschrift, 122, 267-274.
https://doi.org/10.1007/BF01109920
[4] Liebeck, M.W. and Saxl, J. (1986) The Finite Primitive Permutation Groups of Rank Three. Bulletin of the London Mathematical Society, 18, 165-172.
https://doi.org/10.1112/blms/18.2.165
[5] Liebeck, M.W. and Saxl, J. (1991) On Point Stabilizers in Primitive Permutation Groups. Communications in Algebra, 19, 2777-2786.
https://doi.org/10.1080/00927879108824292
[6] Li, C.H., Lu, Z.P. and Marušič, D. (2004) On Permutation Groups with Small Suborbits and Their Orbital Graphs. Journal of Algebra, 279, 749-770.
https://doi.org/10.1016/j.jalgebra.2004.03.005
[7] Xu, M.Y. (1999) The Theory of Finite Groups. Beijing Science Press, Beijing. (In Chinese)
[8] Wu, J. (2014) The Orbital Graphs of Primitive Permutation Groups with Socle A6 x A6. Master Degree Thesis, Yunnan Normal University, Kunming.
[9] Wu, C.X. (2017) The Orbital Graphs of Finite Permutation Groups and Their Relevant Edge-Transitive Graphs. Doctor Thesis, Yunnan University, Kunming.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.