1. Introduction
Let G be a primitive group with the socle
, and
,
. G acts on
. The stabilizer of
in G is
,
is the orbit of
under G. For any
, we call the orbit of
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
. For each orbital Δ of G and each
, we define
which is the set of points which are in the same orbit with
under
. It is easy to verify that the mapping
is a bijection from the set of orbitals of G onto the set of orbits of
with the diagonal orbital mapping onto the trivial orbit
. In particular, the number of orbits is equal to the number of orbits of
, 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
, where E is a subset of
. V represents the vertex set and E represents the edge set. If
whenever
, 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
, where T is a nonabelian simple group, is the unique maximal subgroup in
. He also calculated the lengths of the suborbits of
. In 2014, the author has analyzed the orbitals of primitive group with socle
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
,
,
. Consider the right multiplicative action of G on
. Then the information of the orbitals of G on Ω is listed in the following table:
where in the table,
represents the stabilizer of the point stabilizer H on an orbit;
represents the length of suborbit;
Because the order of
is 2520, which is a little large. Also the number of subgroups of
is more than
and
and the structure of subgroup is very complex. So discuss the orbital graph of
is a challenge job. In this paper, we depart the elements of
by conjugation in Lemma 3.1 firstly, and determine the length of suborbits, then we obtain the stabilizers of two points in
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,
, then the number of the conjugated elements of a in G is
.
Lemma 2.2 [7] Let T be a non-abelian simple group,
. Let
. Then H is maximal subgroup of G, and so the action of G on the set
is primitive.
Lemma 2.3 [7] Let
, and T be a nonabelian simple group. Let
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
such that
. In this case, we have
,
. In particular,
is even.
3. The Orbital Graphs of Primitive Group with Socle A7 × A7
According to the Latex, we know the maximal subgroups of
are
,
,
,
,
, so we can know all subgroups of
. 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
. Dividing the elements in
by conjugation, then we have the following result:
1) The element (1) forms a conjugate class, denote it by
, then
;
2) The elements of type
form a conjugate class, denote it by
. Then
, and the length is 105;
3) The elements of type
form a conjugate class, denoted it by
. Then
, and the length is 70;
4) The elements of type
form a conjugate class, denoted it by
. Then
, and the length is 280;
5) The elements of type
form a conjugate class, denoted it by
. Then
, and the length is 630;
6) The elements of type
form a conjugate class, denoted it by
. Then
, and the length is 210;
7) The elements of type
form a conjugate class, denoted it by
. Then
, and the length is 504;
8) The elements of type
form two conjugate classes, denoted them by
and
. Then
and the length is 360;
and the length also is 360.
Proof.
, obviously,
. For
, since
and for arbitrary two elements
, there exist
such that
, so
.
Similar, for
,
.
For
,
.
For
,
.
For
,
.
For
,
.
Because
, but
does not belong in
, so they form two different conjugate classes.
For
,
.
For
,
.
According to Lemma 2.3, the length of suborbits of
acts on
are 1, 105, 70, 280, 630, 210, 504, 360 and 360. We denote them by
.
Now we calculate the order of two-point stabilizer. Let
acts primitively on
, where
.
is the stabilizer of
in G. For arbitrary
, by Lemma 2.3,
. Then
. So let
acts on
by conjugation, then:
1) If
, then
;
2) If
, then
;
3) If
, then
;
4) If
, then
;
5) If
, then
;
6) If
, then
;
7) If
, then
;
8) If
, then
;
9) If
, then
.
According to the order of
, we can determine the two-point stabilizer subgroups. Then we have the following result:
Lemma 3.2 Let
,
,
be the conjugate class in
. Then:
1) For
, there is
;
2) For
, there is
;
3) For
, there is
;
4) For
, there is
;
5) For
, there is
;
6) For
, there is
;
7) For
, there is
;
8) For
, there is
;
9) For
, there is
.
In order to know the suborbits are self-paired or not, by Lemma 2.4, we need to calculate the
. Let
,
,
, then
. Take
,
, we have:
. So
,
,
. There exists
such that
,
, then g can be described as
, so
and
and
.
Let
, we have:
1)
.
Obviously,
.
2)
.
By GAP, we know
,
, so
.
3)
.
Because
is the maximal subgroup of
and
is the subgroup of
,
.
. So:
.
4)
.
Because
and
is maximal in
,
. And also because
and
don’t centralize
,
. So:
.
5)
Because
,
and
is the maximal subgroup of
,
is the maximal subgroup of
,
. And also because
does not centralize
,
. So:
.
6)
Similar to
, by GAP, we have
,
, so
.
7)
Because
is simple group, which has no normal subgroup, and the subgroups of
is
,
,
. So:
.
8)
is a maximal subgroup of
and
is a maximal subgroup of
, so
,
. So:
.
In the following paragraph, we will discuss whether suborbits are self-paired or not.
1) For
, obviously, this suborbit is self-paired.
2) For
,
, so it is not self-paired.
3) For
,
, so it is self-paired.
4) For
,
, so it is self-paired.
5) For
,
, so it is self-paired.
6) For
,
, so it is self-paired.
7) For
,
, so it is self-paired.
8) For
,
, 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
acts primitively on
, where
. 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).