Groups | PSp4(3) | PSp4(5) | PSp4(7) |
Order | 26⋅34⋅5 | 26⋅32⋅54⋅13 | 28⋅32⋅54⋅74 |
Γ(⋅) | ![]() |
![]() |
![]() |
Let G be a finite group, cd(G) the set of all irreducible character degrees of G, and ρ(G) the set of all prime divisors of integers in cd(G). For a prime p and a positive integer n, let np denote the p-part of n. The degree prime-power graph of G is a graph whose vertex set is V(G)={pep(G)∣p∈ρ(G)}, where pep(G)=max{np∣n∈cd(G)}, and there is an edge between distinct numbers x,y∈V(G) if xy divides some integer in cd(G). The authors have previously shown that some non-abelian simple groups can be uniquely determined by their orders and degree prime-power graphs. In this paper, the authors build on this work and demonstrate that the symplectic simple group PSp4(p) can be uniquely identified by its order and degree prime-power graph.
Citation: Chao Qin, Yu Li, Zhongbi Wang, Guiyun Chen. Recognition of the symplectic simple group PSp4(p) by the order and degree prime-power graph[J]. AIMS Mathematics, 2024, 9(2): 2808-2823. doi: 10.3934/math.2024139
[1] | Yang Zhang, Jizhu Nan . A note on the degree bounds of the invariant ring. AIMS Mathematics, 2024, 9(5): 10869-10881. doi: 10.3934/math.2024530 |
[2] | Sufyan Asif, Muhammad Khalid Mahmood, Amal S. Alali, Abdullah A. Zaagan . Structures and applications of graphs arising from congruences over moduli. AIMS Mathematics, 2024, 9(8): 21786-21798. doi: 10.3934/math.20241059 |
[3] | Shitian Liu . Finite groups for which all proper subgroups have consecutive character degrees. AIMS Mathematics, 2023, 8(3): 5745-5762. doi: 10.3934/math.2023289 |
[4] | Bilal A. Rather, M. Aijaz, Fawad Ali, Nabil Mlaiki, Asad Ullah . On distance signless Laplacian eigenvalues of zero divisor graph of commutative rings. AIMS Mathematics, 2022, 7(7): 12635-12649. doi: 10.3934/math.2022699 |
[5] | Piyapat Dangpat, Teerapong Suksumran . Regularity of extended conjugate graphs of finite groups. AIMS Mathematics, 2022, 7(4): 5480-5498. doi: 10.3934/math.2022304 |
[6] | Saba Al-Kaseasbeh, Ahmad Erfanian . A bipartite graph associated to elements and cosets of subgroups of a finite group. AIMS Mathematics, 2021, 6(10): 10395-10404. doi: 10.3934/math.2021603 |
[7] | Yang Zhang, Shuxia Liu, Liwei Zeng . A symplectic fission scheme for the association scheme of rectangular matrices and its automorphisms. AIMS Mathematics, 2024, 9(11): 32819-32830. doi: 10.3934/math.20241570 |
[8] | Bilal A. Rather, Fawad Ali, Nasim Ullah, Al-Sharef Mohammad, Anwarud Din, Sehra . $ A_{\alpha} $ matrix of commuting graphs of non-abelian groups. AIMS Mathematics, 2022, 7(8): 15436-15452. doi: 10.3934/math.2022845 |
[9] | Tariq A. Alraqad, Hicham Saber . On the structure of finite groups associated to regular non-centralizer graphs. AIMS Mathematics, 2023, 8(12): 30981-30991. doi: 10.3934/math.20231585 |
[10] | Naveed Iqbal, Mohammad Alshammari, Wajaree Weera . Numerical analysis of fractional-order nonlinear Gardner and Cahn-Hilliard equations. AIMS Mathematics, 2023, 8(3): 5574-5587. doi: 10.3934/math.2023281 |
Let G be a finite group, cd(G) the set of all irreducible character degrees of G, and ρ(G) the set of all prime divisors of integers in cd(G). For a prime p and a positive integer n, let np denote the p-part of n. The degree prime-power graph of G is a graph whose vertex set is V(G)={pep(G)∣p∈ρ(G)}, where pep(G)=max{np∣n∈cd(G)}, and there is an edge between distinct numbers x,y∈V(G) if xy divides some integer in cd(G). The authors have previously shown that some non-abelian simple groups can be uniquely determined by their orders and degree prime-power graphs. In this paper, the authors build on this work and demonstrate that the symplectic simple group PSp4(p) can be uniquely identified by its order and degree prime-power graph.
Throughout the following, all groups are assumed to be finite, and all characters are complex characters. Let G be a group, then Irr(G) denotes the set of all irreducible characters of G, and cd(G) denotes the set of all irreducible character degrees of G. For a positive integer n, we use π(n) to denote the set of all prime divisors of n. For convenience, we write π(G)=π(|G|), and ρ(G)=⋃χ∈Irr(G)π(χ(1)). For a prime p, the p-part of n, denoted by np, is the maximum power of p such that np∣n. CFSG is the abbreviation for the Classification Theorem of Finite Simple Groups.
The set cd(G) is very important for studying G. Many results have been obtained about the relationship between the set cd(G) and the structure of G. This paper's primary focus centers on finite non-abelian simple groups. In 2000, Huppert proposed a conjecture: "If S is a non-abelian simple group such that cd(G)=cd(M), then G≅ M×A, where A is an abelian group" (see [1]). Currently, this conjecture has not been fully proven. If Huppert's conjecture proves valid, it would follow naturally that all finite non-abelian simple groups could be uniquely determined by their orders and sets of irreducible character degrees. Interestingly, provided |G|=|M| and fewer numbers in cd(G) require consideration, one can still deduce the same conclusion more efficiently. Researchers have shown that certain simple groups can be uniquely determined by their orders and at most three distinct irreducible character degrees (see [2,3,4,5,6] etc.).
Other researchers have studied the structure of a finite group with the character degree graph Δ(G). The vertex set of Δ(G) is ρ(G). In Δ(G), two vertices are joined by an edge if the product of them divides some number in cd(G). The character degree graph has been widely studied, for example, in [7]. Clearly, Δ(G) contains much less information of cd(G). An interesting fact is that some simple groups (not all) can be uniquely determined by their orders and degree graphs.
In [8], Khosravi et al. proved that A5, A6, A7, A8, L3(3), L3(4), L2(64), L2(q) (where q is an odd prime or a square of an odd prime, and q⩾5), and L2(2α) (where α is a positive integer such that 2α−1 or 2α+1 is a prime) can be uniquely determined by their orders and character degree graphs. However, in [9] Heydari and Ahanjideh gave a counter example of this characterization, that is, M12 and A4×M11 have the same order and character degree graph. To overcome this shortcoming, Chao Qin and Guiyun Chen defined a new graph by using the information of cd(G) in [10], which is called the degree prime-power graph Γ(G).
Definition. For every p∈ρ(G), let pep(G)=max{χ(1)p∣χ∈Irr(G)} and V(G)={pep(G)∣p∈ρ(G)}. Define the degree prime-power graph Γ(G) of G as follows: V(G) is the vertex set, and there is an edge between distinct numbers x,y∈V(G) if xy divides some integer in cd(G). Denote the edge between distinct numbers x,y∈V(G) by x∼y, and the set of all edges of Γ(G) by E(G).
Chen, Qin, Wang and et al. have proven that the group M12 can be uniquely determined by its order and degree prime-power graph. They have also shown that all sporadic simple groups, PSL2(p), PSL2(p−1) (where p is a Fermat prime), PSL2(p2), and PSL2(p3) can be uniquely determined by their orders and degree prime-power graphs (see [10,11,12,13]). In this paper, we continue this investigation for the symplectic simple group PSp4(p). The following theorem is our main result.
Main Theorem. Let p be an odd prime, then G≅PSp4(p) if and only if |G|=|PSp4(p)| and Γ(G)= Γ(PSp4(p)).
In this section, we present the degree prime-power graph of PSp4(p) when p is an odd prime, along with an important proposition.
By Atlas [14] and Magma, we obtain the order and the degree prime-power graph of PSp4(p) when p=3,5,7 (see Table 1).
Groups | PSp4(3) | PSp4(5) | PSp4(7) |
Order | 26⋅34⋅5 | 26⋅32⋅54⋅13 | 28⋅32⋅54⋅74 |
Γ(⋅) | ![]() |
![]() |
![]() |
If p>7, then the order of PSp4(p) is
|PSp4(p)|=12p4(p2−1)(p4−1)=p4(p−1)2(p+1)2(p2+12). |
The character degrees of PSp4(p) were determined by Shahabi and Mohtadifar in [15], that is
cd(PSp4(p))={1,12p(p2+1),12p(p+1)2,p4,12p(p−1)2,p4−1,(p−1)2(p2+1),(p−1)2(p+1)2,(p+1)(p2+1),(p−1)(p2+1),p(p+1)(p2+1),p(p−1)(p2+1),12(p4−1),p(p2+1),12(p2+1),12p2(p2+1),12(p−1)2(p2+1),(p−1)2(p2+1),12(p+1)2(p2+1),12(p+ϵ)(p2+1),12p(p+ϵ)(p2+1)} |
where ϵ=(−1)(p−1)/2. We see that PSp4(p) has irreducible characters of the following degrees:
p4,(p−1)2(p+1)2,(p−1)2(p2+1),(p+1)22(p2+1). | (2.1) |
Note that
(p−1,p+1)=2,(p−1,p2+12)=(p+1,p2+12)=1, |
and we have |PSp4(p)|2=((p−1)2(p+1)2)2, moreover, 2e2(PSp4(p))=|PSp4(p)|2 by (2.1). Similarly, for every r∈ρ(PSp4(p))=π(PSp4(p)), one has
rer(PSp4(p))=|PSp4(p)|r. |
That means the vertex set of Γ(PSp4(p)) is
V(PSp4(p))={|PSp4(p)|r|r∈π(PSp4(p))}. |
Observing cd(PSp4(p)), the edges of Γ(PSp4(p)) can be described as
(1) p4 is an isolated vertex,
(2) let r1, r2∈π(PSp4(p))∖{2,p}. From (2.1) there is an edge
rer1(PSp4(p))1∼rer2(PSp4(p))2,i.e.,|PSp4(p)|r1∼|PSp4(p)|r2, |
(3) for every r∈π((p−1)2(p+1)2)∖{2}, there is an edge |PSp4(p)|2∼|PSp4(p)|r,
(4) for every r∈π((p+1)22), there is not an edge |PSp4(p)|2∼|PSp4(p)|r.
Apart from the above cases, the following holds.
Proposition 2.1. If p⩾7 and r∈π(PSp4(p))∖{p,3}, then there is always an edge |PSp4(p)|3∼|PSp4(p)|r in Γ(PSp4(p)).
Proof. By the above statements about Γ(PSp4(p)), we only need to prove
3∈π((p−1)2(p+1)2). |
This is trivial, because we can obtain 3|(p−1)(p+1) by 3∤p.
Example. The orders of PSp4(11) and PSp4(13) respectively are
|PSp4(11)|=114(11−1)2(11+1)2(112+12)=114⋅(26⋅32⋅52)⋅61,|PSp4(13)|=134(13−1)2(13+1)2(132+12)=134⋅(26⋅32⋅72)⋅5⋅17. |
Using the description above, we obtain the degree prime-power graphs of PSp4(11) and PSp4(13) (see Figure 1).
In this section, we study a subnormal chain of non-solvable groups through some lemmas. These lemmas will play an important role in the proof of the main theorem.
Lemma 3.1. [10,Lemma 2.5] Let G be a non-solvable group. If T/S is a non-abelian chief factor of G, then there is a normal series 1≤H<K≤G such that K/H≅T/S and G/K≲Out(T/S).
Lemma 3.2. [10,Corollary 2.1] Let G be a non-solvable group. Then there is a subnormal series
G=G0⩾G1>G2⩾⋯>G2k−2⩾G2k−1>G2k⩾1,(k⩾1) | (3.1) |
such that G2k is solvable, G2i−1/G2i is a non-abelian chief factor of G2i−2, and
G2i−2/G2i−1≲Out(G2i−1/G2i) |
for each 1⩽i⩽k.
For convenience, we denote the subnormal series in Lemma 3.2 by sn2k, or snH2k if the subnormal subgroups in the series are written as Hi, and denote the j-th term in sn2k by sn2k(j), where 0⩽j⩽2k. Generally, sn2k is not unique for G.
Lemma 3.3. Let G be a finite non-solvable group, and M be a non-abelian composition factor of G. If, for any sn2k and any 1⩽i⩽k, the quotient group sn2k(2i−2)/sn2k(2i−1) does not have a non-abelian composition factor which is isomorphic to M, then there exists a subnormal series
snH2t:G=H0⩾H1>H2⩾⋯>H2t−2⩾H2t−1>H2t⩾1,(t⩾1) | (3.2) |
such that H2t−1/H2t≅Mm for some integer m.
Proof. If M is the unique (up to an isomorphism) non-abelian composition factor of G. By Lemma 3.2, the conclusion is obvious. Now suppose that the non-abelian composition factor of G is not unique (up to an isomorphism).
Assume M1 is a non-abelian composition factor of G and M1 is not isomorphic to M. Suppose T/K is a non-abelian chief factor of G and T/K≅Mm11. By Lemma 3.1, there is a normal series
G=H0⩾H1>H2⩾1 |
such that H1/H2≅T/K≅Mm11 and H0/H1≲Out(H1/H2). By this assumption, M is not a non-abelian composition factor of H0/H1. Then, M is a non-abelian composition factor of H2.
If M is the unique (up to an isomorphism) non-abelian composition factor of H2, then the conclusion holds by Lemma 3.2. If M is not unique (up to an isomorphism) non-abelian composition factor of H2, then we assume that M2 is a non-abelian composition factor of H2 and M2 is not isomorphic to M. Similar to the above reason, there is a normal series
H2⩾H3>H4⩾1 |
such that H3/H4≅Mm22 is a non-abelian chief factor of H2, and H2/H3≲Out(H3/H4). By this assumption, M is a non-abelian composition factor of H4.
Repeating the above process, we obtain a subnormal series
G=H0⩾H1>H2⩾⋯>H2r−2⩾H2r−1>H2r | (3.3) |
such that
(1) M is the unique (up to an isomorphism) non-abelian composition factor of H2r;
(2) H2i−1/H2i≅Mmii is a non-abelian chief factor of H2i−2, and H2i−2/H2i−1≲Out(H2i−1/H2i) where Mi is not isomorphic to M and i=1, ⋯, r.
By Lemma 3.2, there is a subnormal series
H2r⩾H2r+1>H2r+2⩾⋯>H2t−2⩾H2t−1>H2t⩾1 | (3.4) |
such that H2t is solvable, H2i−1/H2i≅Mmi is a non-abelian chief factor of H2i−2, and H2i−2/H2i−1≲Out(H2i−1/H2i) for each r+1⩽i⩽t. Therefore, the proof is complete by (3.3) and (3.4).
Lemma 3.4. Let G be a group, and p be an odd prime. Suppose that
(1) |G|⩽p10, and
(2) G has a non-abelian composition factor M satisfying p||M|.
Then, there exists a subnormal series sn2k such that
sn2k(2k−1)/sn2k(2k)≅Mm, |
where m is an integer. Specifically, if sn2k(2k)=1, then there exists a subnormal subgroup of G which is isomorphic to M.
Proof. By Lemma 3.3, we only need to prove that for any snH2t and any 1⩽i⩽t the quotient group snH2t(2i−2)/snH2t(2i−1) does not have a non-abelian composition factor which is isomorphic to M.
Otherwise, suppose there is a snH2t such that snH2t(2i−2)/snH2t(2i−1) has a non-abelian composition factor which is isomorphic to M for some 1⩽i⩽t. Note that snH2t(2i−1)/snH2t(2i) is a non-abelian chief factor of snH2t(2i−2), and it is a direct product of isomorphic non-abelian simple groups. Let
snH2t(2i−1)/snH2t(2i)=(M1)m, |
where M1 is a non-abelian simple group. Hence, we have
Out(snH2t(2i−1)/snH2t(2i))=Out(M1)≀Sm. |
For convenience, denote snH2t(2i−2)/snH2t(2i−1) as K, then K≲Out(M1)≀Sm. Without loss of generality, assume K⩽Out(M1)≀Sm. Then
K/K∩(Out(M1))m≅K⋅(Out(M1))m/(Out(M1))m⩽(Out(M1)≀Sm)/(Out(M1))m≅Sm. |
Since M1 is a non-abelian simple group, we know (Out(M1))m is solvable. So, K∩(Out(M1))m is solvable. Because K=snH2t(2i−2)/snH2t(2i−1) has a non-abelian composition factor which is isomorphic to M, we have
M≲K/K∩(Out(M1))m≲Sm, then |M|||Sm|. |
Hence, p||Sm| and p⩽m. Therefore
p10⩾|G|⩾|snH2t(2i−1)/snH2t(2i)|=|(M1)m|=|M1|m⩾|M1|p⩾60p. |
This is a contradiction, because p10⩾60p is impossible.
For the main theorem, the necessity is obvious. It is enough to prove the sufficiency. To achieve this, we need the following series of lemmas.
Lemma 4.1. Let G be a finite group and K be a subnormal subgroup of G. If V(G)={|G|p|p∈π(G)}, then the following statements hold.
(1) G is non-solvable.
(2) Every minimal subnormal subgroup of G is a non-abelian simple group.
(3) 1 is the unique solvable subnormal subgroup of G. Furthermore, for any sn2k, we have sn2k(2k)=1.
(4) If K≠1, then V(K)={|K|p|p∈π(K)}.
(5) If there are p,r∈π(K) such that |G|p∼|G|r is an edge of Γ(G), then |K|p∼|K|r is an edge of Γ(K).
Proof. Statements (1) and (2) are Lemma 2.2 in [10]. Statement (3) is a corollary of (2).
For (4) and (5), without loss of generality we suppose K is a normal subgroup of G. Suppose that χ∈Irr(G) such that χ(1)p=|G|p where p∈π(K). Let θ∈Irr(K) be a constituent of χK. Using Corollary 11.29 in [16], we have χ(1)θ(1)||G/K|. Furthermore,
χ(1)pθ(1)p||G|p|K|p. |
Then, θ(1)p=|K|p by χ(1)p=|G|p. Hence, |K|p∈V(K). This means statement (4) holds.
Let p,r∈π(K) such that |G|p∼|G|r is an edge of Γ(G), then there exists χ∈Irr(G) satisfying (|G|p⋅|G|r)|χ(1). If ϕ∈Irr(K) is a constituent of χK, then χ(1)θ(1)||G/K| by Corollary 11.29 in [16]. Hence, (|K|p⋅|K|r)|ϕ(1), i.e., |K|p∼|K|r is an edge of Γ(K). Statement (5) holds.
Lemma 4.2. The following statements about the exceptional group of Lie type 2B2(22n+1) (n⩾1) hold.
(1) 2B2(22n+1) is the only simple group whose order is prime to 3.
(2) Let p⩾5 be a prime. If
p||2B2(22n+1)|and|2B2(22n+1)|||PSp4(p)|, |
then n=1 and p=13.
Proof. (1) Obviously, for any alternating group An (n⩾5), its order is divisible by 3. According to Atlas [14], any sporadic simple group's order is divisible by 3 as well as the order of 2F4(2)′.
If M is a simple group of Lie type over GF(q) with M≠2F4(2)′ and 2B2(22n+1) (n⩾1), then q(q2−1)||M|. Notice that 3|q(q2−1), and we have 3||M|.
The order of 2B2(22n+1) is
|2B2(22n+1)|=22n+1(24n+2+1)(22n+1−1). |
Since
22n+1−1=(3−1)2n+1−1≡−2mod3,24n+2−1=(3−1)4n+2+1≡ 2mod3, |
the order of 2B2(22n+1) is not divisible by 3. This completes the proof of (1) by CFSG.
(2) Suppose
q=22n+1,a=q+√2q+1,b=q−√2q+1,ϵi=1or −1,(i=1,2). |
It is not hard to prove that q2+1=ab, (q2+1,q−1)=1, and (a,b)=1. Hence,
|2B2(22n+1)|=|2B2(q)|=q2(q−1)(q2+1)=q2(q−1)ab. |
By p||2B2(22n+1)|, we have
p|(q−1),p|aorp|b. |
From |2B2(22n+1)|||PSp4(p)|, it follows that q2|(p+1)2(p−1)2, i.e., q|(p+1)(p−1). Since (p+1,p−1)=2, we get
q|2(p+1)orq|2(p−1). |
(i) If p|(q−1) and q|2(p+ϵ1), then there are positive integers k and m such that
q−1=pkand 2(p+ϵ1)=qm. |
It follows that
2(p+ϵ1)=(pk+1)m,i.e., (mk−2)p=−m+2ϵ1. |
Hence p|−m+2ϵ1.
If −m+2ϵ1=0, then m=2 and ϵ1=1, moreover, q=p+1, i.e., p=q−1. Therefore,
|PSp4(p)|=(q−1)4(q−2)2q212(q2−2q+2). |
By |2B2(22n+1)|||PSp4(p)|, we obtain
q2+1|(q−1)3(q−2)212(q2−2q+2). | (4.1) |
A short calculation reveals that
q2+1=(q−2)(q+2)+5, and q2−2q+2=(q2+1)−2(q−1). |
Then, (q2+1,q−2)|5 and (q2+1,q2−2q+2)=(q2+1,q−1)=1. Consequently, by (4.1) we know that q2+1|(q−2)2, and q2+1 is a power of 5. This leads to π(|2B2(22n+1)|)={2,5,p}. This is a contradiction, because |2B2(22n+1)| is not a K3-simple group, where the so-called K3-simple group is a non-abelian simple group with only three prime factors of its order.
Now we assume −m+2ϵ1≠0. By p|−m+2ϵ1, it follows that m⩾p+2ϵ1⩾3. Then, 2(p+ϵ1)=mq⩾3(pk+1), i.e., 0<(3k−2)p⩽2ϵ1−3<0. This is a contradiction.
(ii) If p|q+ϵ2√2q+1 and q|2(p+ϵ1), then there exist positive integers k and m such that
q+ϵ2√2q+1=pkand 2(p+ϵ1)=qm. | (4.2) |
Then, 2(q+ϵ2√2q+1)=2pk=(qm−2ϵ1)k. Substituting q=22n+1 into this equation yields
2n+1(2n+ϵ2−2n−1mk)=−1−ϵ1k. | (4.3) |
If 1+ϵ1k=0, then k=1, ϵ1=−1 and 2n+ϵ2−2n−1m=0, i.e., ϵ2=2n−1m−2n. It follows that n=1 and m=ϵ2+2=1 or 3. Therefore, q=22n+1=8 and 2(p−1)=8m=8 or 24, by (4.2). This means that p=5 or 13.
If 1+ϵ1k≠0, then 2n+1|1+ϵ1k by (4.3). We conclude that k⩾2n+1−ϵ1. Therefore,
2(q+ϵ2√2q+1)=(qm−2ϵ1)k⩾(qm−2ϵ1)(2n+1−ϵ1). |
By q=22n+1, the above inequality can be rewritten as
22n+1+ϵ22n+1⩾23n+1m−ϵ1(2n+1+22nm). |
Dividing both sides of this inequality by 2n+1, we get
2n−1[(2n+1−ϵ1)m−2]⩽ϵ1+ϵ2⩽2 |
which implies that (2n+1−ϵ1)m⩽2+22n−1⩽4. This means 2n+1−ϵ1⩽4, moreover,
2n+1⩽4+ϵ1⩽5,i.e.,n=1. |
Therefore, q=22n+1=8. By p|q+ϵ2√2q+1, we obtain that p|q2+1. Then, p=5 or 13.
Because |2B2(8)|=82(82+1)(8−1)=26⋅(5⋅13)⋅7, |PSp4(5)|=26⋅32⋅54⋅13, |PSp4(13)| = 134⋅(26⋅32⋅72)⋅5⋅17, and |2B2(22n+1)|||PSp4(p)|, we obtain that p can only be 13.
Lemma 4.3. If M is a simple group of Lie type over GF(q), where q=pf, then |M|p is an isolated vertex in Γ(M).
Proof. If M is a simple group of Lie type over some GF(q) with M≠2F4(2)′, the result can be obtained directly by Lemma 2.4 in [17]. If M=2F4(2)′, then |M|2=211 is an isolated vertex in Γ(S) by the character table of 2F4(2)′ in [14].
Lemma 4.4. Let G be a group, and p⩾7 be an odd prime. If
|G|=|PSp4(p)|=12p4(p2−1)(p4−1),andΓ(G)=Γ(PSp4(p)), |
then the following statements hold.
(1) Let M be a simple group of Lie type over GF(q) where q=rf. If p||M| and M is a subnormal subgroup of G, then r=p or M≅2B2(8).
(2) If T is a non-abelian composition factor of G, then p∤|Out(T).
(3) For any sn2k and any 1⩽i⩽k, the order of Out(sn2k(2i−1)/sn2k(2i)) is not divisible by p, and p∤|sn2k(2i−2)/sn2k(2i−1)|.
Proof. (1) By the assumption, the vertex set of Γ(G) is V(G)={|G|t|t∈π(G)}. Then, V(M)={|M|t|t∈π(M)} by Lemma 4.1(4).
First, we suppose that r≠p and M is not isomorphic to 2B2(22n+1) (n⩾1).
If r=3, then there exists an edge |G|2∼|G|3 by Proposition 2.1. Because M is not isomorphic to 2B2(22n+1), we know 3||M| and |M|3∼|M|2 is an edge of Γ(M) by Lemma 4.1(5). This is a contradiction, because |M|r is an isolated vertex in Γ(M) by Lemma 4.3.
If r≠3, then there exists an edge |G|r∼|G|3 by Proposition 2.1. We can obtain a contradiction using the same method as before.
Second, assume r≠p and M is isomorphic to 2B2(22n+1) (n⩾1). By Lemma 4.2(2), we see that M is isomorphic to 2B2(8) and p=13. This completes the proof of (1).
(2) Assume T is a non-abelian composition factor of G, and p||Out(T). Since p is an odd prime, T is not isomorphic to an alternating group, one of 26 sporadic simple groups or the Tits simple group 2F4(2)′, because the outer automorphism groups of these simple groups are 1, C2, or C2×C2. By CFSG, T is a simple group of Lie type over some GF(q) except 2F4(2)′, where q=rf, and r is a prime. Therefore, |Out(T)|=dfg where d, f, and g are the orders of diagonal, field, and graph automorphisms of T, respectively. By Table 5 in [14], we know that g|6, so p∤g. Therefore, if p||Out(T)|, then p|d or p|f.
If p|d, then T is isomorphic to An(q) or 2An(q) (i.e., PSLn+1(q) or PSUn+1(q)) by Table 5 in [14]. Assume T≅An(q), then d=(n+1,q−1) and
|T|=|An(q)|=1(n+1,q−1)qn(n+1)/2n∏i=1(qi+1−1). |
Hence, n+1⩾p⩾7, p|q−1, and p||T|. By Lemma 3.4 and Lemma 4.1(3), there exists a subnormal subgroup K⊴⊴G such that K≅T≅An(q). It follows that q=pf by (1). It contradicts to p|q−1. Using the same method, one can demonstrate that T≆2An(q).
Now, we assume p|f. It follows that q=rkp⩾2p⩾27. If T is not isomorphic to A1(q), then one can obtain
|T|⩾q3(q+1) |
by observing the order of a simple group of Lie type over GF(q). Hence,
12p4(p2−1)(p4−1)=|G|⩾|T|⩾q3(q+1)⩾23p(2p+1). |
This implies p⩽5 by Maple. This contradicts p⩾7.
If T is isomorphic to A1(q), then |T|=1(2,q−1)q(q2−1). When p⩾7, one can obtain the following inequality by Maple:
12p4(p2−1)(p4−1)<12⋅3p(32p−1). | (4.4) |
However, since (2,q−1)⩽2 and q=rkp, we have
12p4(p2−1)(p4−1)=|G|⩾|T|=1(2,q−1)q(q2−1)⩾12⋅rkp(r2kp−1). | (4.5) |
By inequalities (4.4) and (4.5), one can see that rk=2, i.e., q=2p. Then, |T|=1(2,2p−1)2p(22p−1)=2p(22p−1). Using Maple to solve the inequality |G|⩾|T|, we conclude that p⩽11, i.e., p=7 or 11. If p=7, then |T|=27⋅3⋅43⋅127 and |G|=28⋅32⋅54⋅74. This is a contradiction to |T|||G|. If p=11, then |T|=211⋅3⋅23⋅89⋅683 and |G|=114⋅(26⋅32⋅52)⋅61. This is a contradiction. Therefore, f is not divisible by p when p⩾7. This completes the proof of (2).
(3) Suppose that there exists an sn2k and i such that
p||Out(sn2k(2i−1)/sn2k(2i))|. |
Notice that sn2k(2i−1)/sn2k(2i) is a non-abelian chief factor of sn2k(2i−2), and we have
Out(sn2k(2i−1)/sn2k(2i))=Out(T)≀Sm |
where T is a non-abelian composition factor of G, and sn2k(2i−1)/sn2k(2i) is a direct product of m copies of T. By the proof of Lemma 3.4, we know p∤|Sm|. Hence, p||Out(T)|. However, this is impossible by (2). Therefore, statement (3) is proved.
Now we can present a proof of the main theorem based on the above lemmas.
Proof of Main Theorem. Obviously, it is enough to prove the sufficiency. We first prove the sufficiency when p=5. If p=5, then |G|=|PSp4(5)|=26⋅32⋅54⋅13 and Γ(G)=Γ(PSp4(5)). Hence,
V(G)={|Gr|r∈π(G)}={26,32,54,13},E(G)={26∼32}. |
By Lemma 4.1, G is non-solvable and every minimal subnormal subgroup of G is a non-abelian simple group. Let N be a minimal normal subgroup of G. Then, N is a direct product of isomorphic non-abelian simple groups. It is enough to prove N≅PSp4(5). By |N|||G|, we know that N is isomorphic to one of A5, A5×A5, A6, PSL3(3), PSL2(25), PSU3(4), PSp4(5) by [14]. If N is isomorphic to one of A5, A5×A5, A6, PSL3(3), PSU3(4), then |N|2∼|N|3 is not an edge of Γ(N) by checking their character table in [14]. However, there exists an edge |N|2∼|N|3 in Γ(N) by Lemma 4.1(5). This is a contradiction. If N≅PSL2(25), then
G/(CG(N)×N)≲Out(N). |
By |N|=|PSL2(25)|=23⋅3⋅52⋅13 and Out(PSL2(25))≅C2×C2, we have |CG(N)|=2α⋅3⋅52, where α=1, 2, or 3. Notice that CG(N)⊲G, and we know there exists a minimal subnormal subgroup of G, denoted by T, such that T⩽CG(N). Hence, T is isomorphic to A5. By Lemma 4.1(5), there exists an edge |T|2∼|T|3 in Γ(T), a contradiction. Therefore, N≅PSp4(5), moreover, G≅PSp4(5).
When p⩾7, we will discuss all non-abelian composition factors of G whose order can be divisible by p, covering all possible cases. Our proof for this purpose will consist of 5 steps. Now, assume that T is a non-abelian composition factor of G satisfying p||T|.
Step 1. Give information about the degree-power graph Γ(T).
By Lemma 4.1(3) and Lemma 3.4, there exists a subnormal subgroup of G which is isomorphic to T. Let r∈π(T)∖{p,3}. Then there is an edge |T|3∼|T|r in Γ(T), by Lemma 4.1(5) and Proposition 2.1.
Step 2. Prove T is not isomorphic to an alternating group An.
On the contrary, T is isomorphic to an alternating group An. By p||T|, we know p⩽n, moreover, p!2||T|. Notice that |T|||G|, and we see that
p!|p4(p2−1)(p4−1). |
By (p+1e)p<p! (e is the natural constant), the following inequality holds:
(p+1e)p<p4(p2−1)(p4−1). |
Using Maple, it implies p⩽13. If p=13, then p!=210⋅35⋅52⋅7⋅11⋅13, p4(p2−1)(p4−1)=27⋅32⋅5⋅72⋅134⋅17. This contradicts p!|p4(p2−1)(p4−1). If p=11, then p!=28⋅34⋅52⋅7⋅11, p4(p2−1)(p4−1)=27⋅32⋅52⋅114⋅61, a contradiction. If p=7, then |G|=28⋅32⋅54⋅74. Therefore, T only is isomorphic to A7 or A8 by |T|||G|. Observing the character tables of A7 and A8 in [14], there is not an edge |T|2∼|T|3 of Γ(T). However, |T|2∼|T|3 should be an edge of Γ(T) by {Step 1.} This is a contradiction.
Step 3. Prove T is not isomorphic to any sporadic simple group.
We assume that T is isomorphic to one of following simple groups:
M11,M12,M22,M23,M24,J1,J2,J3,Co1,Co2,Co3,Fi22,Fi23,Fi′24,Suz,HS,McL,He,HN,Th,B,M,Ru. |
Observing the degree prime-power graphs of the above 23 sporadic simple groups in [11], there is not an edge |T|2∼|T|3 in Γ(T). This is a contradiction, by Step 1. Next, we analyze the remaining three sporadic simple groups: O′N, Ly, J4.
If T is isomorphic to O′N, then π(T)={2,3,5,7,11,19,31}. By Step 1, for every r∈π(T)∖{p,3}, there is an edge |T|3∼|T|r in Γ(T). This indicates that there are at least 5 edges at vertex |T|3. However, by the character table of O′N, we know there are only 3 edges at vertex |T|3, i.e., |T|3∼|T|2, |T|3∼|T|5 and |T|3∼|T|31. This is a contradiction. Using the same method, one can obtain a contradiction when T is isomorphic to Ly.
If T≅J4, then |T|=221⋅33⋅5⋅7⋅113⋅23⋅29⋅31⋅37⋅43. Since p||T|, we obtain p=7, 11, 23, 29, 31, 37 or 43. Through calculations using the Magma, we have |PSp4(p)|2|213 when p∈{7,11,23,29,31,37,43}. This contradicts |T|||PSp4(p)|.
Therefore, T is not isomorphic to any sporadic simple group.
Step 4. Prove T is isomorphic to one of A1(p3)(=PSL2(p3)), A2(p)(=PSL3(p)), 2A2(p)(=PSU3(p)), and B2(p)(=PSp4(p)).
By Steps 2 and 3, T is a simple group of Lie type over some GF(q) where q=rf. Hence, by Lemma 4.4(1), we know r=p or T≅2B2(8).
Assume T≆2B2(8), then r=p⩾7. Since |G|p=p4, we can obtain that T is isomorphic to one of
A1(pi)(=PSL2(pi)),i=1,2,3,4;A2(p)(=PSL3(p)),B2(p)(=PSp4(p)),2A2(p)(=PSU3(p)). |
Notice that
|A1(p)|=12p(p2−1),|A1(p2)|=12p2(p2−1)(p2+1),|A1(p3)|=12p3(p6−1)=12p3(p−1)(p2+p+1)(p3+1),|A1(p4)|=12p4(p4−1)(p4+1),|A2(p)|=p3(p2−1)(3,p−1)(p3−1),|2A2(p)|=p3(p2−1)(3,p−1)(p3+1). |
By [18], the degrees of A1(p) and A1(p2) are
cd(A1(p))={1,p,p+ε2,p−1,p+1},(ε=(−1)(p−1)/2),cd(A1(p2))={1,p2,p2+12,p2−1,p2+1} |
respectively.
If T≅A1(p2), then we can obtain that |T|3∼|T|s is not an edge of Γ(T) for every s∈π(p2+12), because 3|(p2−1) and (p2−1,p2+1)=2. By Step 1, this is a contradiction.
If T≅A1(p) and p−12 is an even number, then ϵ=−1 and cd(T)={1,p,p+12,p−1,p+1} where p+12=p−12+1 is an odd number. Hence, for every s∈π(p+12) and t∈π(p−1) there is not an edge |T|s∼|T|t in Γ(T). Since s, t∈π((p−1)2(p+1)2) and PSp4(p) has an irreducible character of degree (p−1)2(p+1)2, then |G|s∼|G|t is an edge of Γ(G). By Step 1, T is isomorphic to a subnormal subgroup of G. Hence, |T|s∼|T|t is an edge of Γ(T) by Lemma 4.1(5). So, it is a contradiction. Using the same method, there is a contradiction when p−12 is an odd number.
If T≅A1(p4), then |T|>|G| obviously. This is a contradiction.
Assume T≅2B2(8), then p=13 by Lemma 4.2. Hence, |T|=26⋅5⋅7⋅13 and |G|=|PSp4(13)| = 134⋅(26⋅32⋅72)⋅5⋅17. Observing |T|2=|G|2, we can conclude that G has only one non-abelian composition factor. By Lemma 3.2 and 4.1(2), there is a subnormal series
snG2:G=G0⩾G1>G2=1 |
such that G1/G2≅T and G0/G1≲Out(T). This will lead to a contradiction. Since the outer automorphism group is C3, we obtain |G|=|G1/G2|⋅|G0/G1|⩽|T|⋅|C3|=26⋅5⋅7⋅13⋅3. That is impossible.
Based on the above discussion, T is isomorphic to one of A1(p3)(=PSL2(p3)), A2(p)(=PSL3(p)), 2A2(p)(=PSU3(p)), and B2(p)(=PSp4(p)).
Step 5. Prove G is isomorphic to PSp4(p).
Take a subnormal series snGk
snG2k:G=G0⩾G1>G2⩾⋯>G2k−2⩾G2k−1>G2k⩾1,(k⩾1). |
By Lemmas 4.1(3) and 4.4(3), we have G2k=1 and p∤|G2i−2/G2i−1| where i=1, 2, ⋯, k. It follows that
p4|k∏i=1|G2i−1/G2i|. | (4.6) |
Notice that every G2i−1/G2i is a product of isomorphic non-abelian simple groups, and we assume that the direct product factor of G2i−1/G2i is Ti for i=1,2,⋯,k. Then there exists a Tj1 such that its order is divisible by p. By Step 4, Tj1 is isomorphic to one of PSL2(p3), PSL3(p), PSU3(p), and PSp4(p). We claim Tj1 is isomorphic to PSp4(p). Otherwise, Tj1 is isomorphic to PSL2(p3), PSL3(p), or PSU3(p). Then |Tj1|p=p3, moreover G2j1−1/G2j1≅Tj1 by |G|p=p4. Hence, there is a Tj2 such that its order is divisible by p, and |Tj2|p can only be p1. This contradicts the result in {Step 4}. Therefore, G has a non-abelian composition factor that is isomorphic to PSp4(p). This means G≅PSp4(p). This completes the proof of Main Theorem.
We have primarily investigated whether the symplectic simple group PSp4(p) can be uniquely determined by its order and degree prime-power graph. In the main theorem, we provide a positive answer to this question. In Lemma 3.3, a sufficient condition for adjusting the positions of specific non-abelian composition factors in the subnormal series sn2k is provided. This condition plays a crucial role in the proof of the main theorem. We believe that this condition is valuable for studying the characterization of more non-abelian simple groups. Based on the results of this paper and [10,11,12,13], we conjecture that most non-abelian simple groups can be uniquely determined by their orders and degree prime-power graphs.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This work was supported by the Doctoral Through Train Scientific Research Project of Chongqing (No. sl202100000324), Guangxi Natural Science Foundation (No. 2022GXNSFBA035572), Scientific and Technological Research Program of Chongqing Municipal Education Commission (No. KJQN202300846) and National Natural Science Foundation of China (Nos. 12301021 and 12071376).
The authors declare no conflicts of interest.
[1] |
B. Huppert, Some simple groups which are determined by the set of their character degrees I, Illinois J. Math., 44 (2000), 828–842. http://dx.doi.org/10.1215/ijm/1255984694 doi: 10.1215/ijm/1255984694
![]() |
[2] |
H. Behravesh, M. Ghaffarzadeh, M. Ghasemi, S. Hekmatara, Recognition of Janko groups and some simple K4-groups by the order and one irreducible character degree or character degree graph, Int. J. Group Theory, 10 (2021), 1–10. http://dx.doi.org/10.22108/IJGT.2019.113029.1502 doi: 10.22108/IJGT.2019.113029.1502
![]() |
[3] |
S. Heydari, N. Ahanjideh, Characterization of some simple K4-groups by some irreducible complex character degrees, Int. J. Group Theory, 5 (2016), 61–74. http://dx.doi.org/10.22108/IJGT.2016.8233 doi: 10.22108/IJGT.2016.8233
![]() |
[4] |
B. Khosravi, B. Khosravi, B. Khosravi, Z. Momen, A new characterization for the simple group PSL(2,p2) by order and some character degrees, Czech. Math. J., 65 (2015), 271–280. http://dx.doi.org/10.1007/s10587-015-0173-6 doi: 10.1007/s10587-015-0173-6
![]() |
[5] |
H. Xu, G. Chen, Y. Yan, A new characterization of simple K3-groups by their orders and large degrees of their irreducible characters, Commun. Algebra, 42 (2014), 5374–5380. http://dx.doi.org/10.1080/00927872.2013.842242 doi: 10.1080/00927872.2013.842242
![]() |
[6] |
H. Xu, Y. Yan, G. Chen, A new characterization of Mathieu-groups by the order and one irreducible character degree, J. Inequal. Appl., 2013 (2013), 209. http://dx.doi.org/10.1186/1029-242X-2013-209 doi: 10.1186/1029-242X-2013-209
![]() |
[7] |
M. Lewis, An overview of graphs associated with character degrees and conjugacy class sizes in finite groups, Rocky Mountain J. Math., 38 (2008), 175–211. http://dx.doi.org/10.1216/RMJ-2008-38-1-175 doi: 10.1216/RMJ-2008-38-1-175
![]() |
[8] | B. Khosravi, B. Khosravi, B. Khosravi, Z. Momen, Recognition of some simple groups by character degree graph and order, Math. Reports, 18 (2016), 51–61. |
[9] |
S. Heydari, N. Ahanjideh, Some simple groups which are determined by their character degree graphs, Sib. Elektron. Math. Re., 13 (2016), 1290–1299. http://dx.doi.org/10.17377/semi.2016.13.101 doi: 10.17377/semi.2016.13.101
![]() |
[10] |
C. Qin, Y. Yan, K. Shum, G. Chen, Mathieu groups and its degree prime-power graphs, Commun. Algebra, 47 (2019), 4173–4180. http://dx.doi.org/10.1080/00927872.2019.1579342 doi: 10.1080/00927872.2019.1579342
![]() |
[11] | C. Qin, Research on the sporadic simple groups and their degree prime-power graphs of irreducible character degrees, Ph.D thesis, Southwest University, 2019. |
[12] |
Z. Wang, C. Qin, H. Lv, Y. Yan, G. Chen, A new characterization of L2(p2), Open Math., 18 (2020), 907–915. http://dx.doi.org/10.1515/math-2020-0048 doi: 10.1515/math-2020-0048
![]() |
[13] |
Z. Wang, G. Chen, A new characterization of L2(p3), Commun. Algebra, 50 (2022), 4000–4008. http://dx.doi.org/10.1080/00927872.2022.2057509 doi: 10.1080/00927872.2022.2057509
![]() |
[14] | J. Conway, R. Curtis, S. Norton, R. Parker, R. Wilson, Atlas of finite groups, New York: Oxford University Press, 1985. |
[15] | M. Shahabi, H. Mohtadifar, The characters of finite projective symplectic group PSp(4,q), In: Groups St Andrews 2001 in Oxford, Cambridge: Cambridge University Press, 2003,496–527. http://dx.doi.org/10.1017/CBO9780511542787.018 |
[16] | I. Isaacs, Character theory of finite groups, New York: Academic Press, 1976. |
[17] |
H. Tong-Viet, The simple Ree groups 2F4(q2) are determined by the set of their character degrees, J. Algebra, 339 (2011), 357–369, http://dx.doi.org/10.1016/j.jalgebra.2011.04.034 doi: 10.1016/j.jalgebra.2011.04.034
![]() |
[18] |
D. White, Character degrees of extensions of PSL2(q) and SL2(q), J. Group Theory, 16 (2013), 1–33. http://dx.doi.org/10.1515/jgt-2012-0026 doi: 10.1515/jgt-2012-0026
![]() |
Groups | PSp4(3) | PSp4(5) | PSp4(7) |
Order | 26⋅34⋅5 | 26⋅32⋅54⋅13 | 28⋅32⋅54⋅74 |
Γ(⋅) | ![]() |
![]() |
![]() |