1. Introduction
We devote this section to relevant definitions, basic facts about nse, and a brief history of this problem. Throughout this paper, G is a finite group. We express by the set of prime divisors of , and by , we introduce the set of order of elements from G. Set and nse(G)=. In fact, is the number of elements of order k in G and nse(G) is the set of sizes of elements with the same order in G.
One of the important problems in group theory is characterization of a group by a given property, that is, to prove there exist only one group with a given property (up to isomorphism). A finite nonabelian simple group H is called characterizable by nse if every finite group G with implies that .
After the monumental attempt to classify the finite simple groups, a huge amount of information about these groups has been collected. It has been noticed that some of the known simple groups are characterizable by some of their properties. Until now, different characterization are considered for some simple groups.
The twentieth century mathematician J.G. Thompson posed very interesting problem [
1].
Thompson Problem. Let = where is the number of elements with order k. Suppose that . If G is a finite solvable group, is it true that H is also necessary solvable?
Characterization of a group
G by
nse(
G) and
, for short, deals with the number of elements of order
k in the group
G and
, where one must answer the question “is a finite group
G, can be characterized by the set
nse(
G) and
?” While mathematicians might undoubtedly give many answers to such a question, the answer in Shao et al. [
2,
3] would probably rank near the top of most responses. They proved that if
G is a simple
group, then
G is characterizable by
nse and
. Several groups were characterized by nse and order. For example, in [
4,
5], it is proved that the Suzuki group, and sporadic groups are characterizable by nse and order. We remark here that not all groups can be characterized by their group orders and the set nse. For example, let
and
, where
and
are cyclic groups of order 2 and 4, respectively, and
is a quaternion group of order 8. It is easy to see that
and
but
.
We know that the set of sizes of conjugacy classes has an essential role in determining the structure of a finite group. Hence, one might ask whether the set of sizes of elements with the same order has an essential role in determining the structure of a finite group. It is claimed that some simple groups could be characterized by exactly the set nse, without considering the order of group. In [
6,
7,
8,
9,
10,
11,
12], it is proved that the alternating groups
, where
, the symmetric groups
where
,
,
,
where
,
where
,
where
, are uniquely determined by
nse. Besides, in [
13,
14,
15,
16], it is proved that
,
,
, and
are uniquely determined by
nse. Recently, in [
17,
18,
19], it is proved that the simple groups
,
, where
, and
, where
, are uniquely determined by
nse. Therefore, it is natural to ask what happens with other kinds of simple groups.
The purpose of this paper is to continue this work by considering the following theorems:
Theorem 1. Let G be a group such that . Then G is isomorphic to .
Theorem 2. Let G be a group such that . Then G is isomorphic to .
3. Main Results
Suppose
G is a group such that
, where
, or
. By Lemma 1, we can assume that
G is finite. Let
be the number of elements of order
n. We notice that
, where
k is the number of cyclic subgroups of order
n in
G. In addition, we notice that if
, then
is even. If
, then by Lemma 3 and the above discussion, we have
In the proof of Theorem 1 and Theorem 2, we often apply formula (
1) and the above comments.
Proof of Theorem 1. Let
G be a group with
where
is the projective special unitary group of degree 3 over field of order 3. The proof will be divided into a sequence of lemmas.
Lemma 10. .
Proof. First, since
, by Lemma 2,
and
. Let
, by formula (
1),
and
, which implies that
. Now, we prove that
. Conversely, suppose that
. Then formula (
1), implies
. On the other hand, by formula (
1), we conclude that if
, then
and
. Hence,
,
,
, or
, which is a contradiction, and hence
. Since
, the group
acts fixed point freely on the set of elements of order 2, and so, by Lemma 8,
, which is a contradiction. Hence
. Similarly, we can prove that the prime numbers 19 and 1009 do not belong to
. Now, we prove
. Conversely, suppose that
. Then formula (
1), implies
. From the formula (
1), we conclude that if
, then
. On the other hand, if
, then by Lemma 4,
for some integer
t. Hence
, which is a contradiction and hence
. Since
, the group
acts fixed point freely on the set of elements of order 3, and so
, which is a contradiction. From what has already been proved, we conclude that
. ☐
Remark 3. If 3 , 7 , then, by formula (1), and . If , since , then . By Lemma 3, and so . Suppose . Then since , . Therefore, if , then . Hence, we only have to consider two proper sets , , and finally the whole set . Now, we will show that is not equal and . For this purpose at first, we need obtain some information about elements of .
If ), then and so .
By Lemma 3, and so .
If , then .
Lemma 11. and .
Proof. We claim that . Assume the contrary, that is, let . Since , we have . Hence , where and m are non-negative integers and . Since , we have . Now, it is easy to check that the equation has no solution, which is a contradiction. Hence . Our next claim is that . Suppose, contrary to our claim, that . Since , .
Let . Then by Lemma 3, and so . We will consider six cases for .
If , then since , , which is a contradiction.
If , then since and , we have , and . Therefore, , where , and a are non-negative integers and . Since , we have or .
If , then since , we have a contradiction.
If , then where . By a computer calculation it is easily seen that the equation has no solution.
If , then , where , and a are non-negative integers and . Since , we have or .
If , then where . By a computer calculation, it is easily seen that the equation has no solution.
If , then where . In this case, the equation has nine solutions. For example, is one of the solutions. We show this is impossible. Since and it follows that for . On the other hand, since , . Hence, if where , then by Lemma 3. Since , for by a computer calculation, we have , which is a contradiction. The same conclusion can be drawn for other solutions.
If , then , where , and a are non-negative integers and . Since , we have . If , then where . One sees immediately that the equation has no solution.
If , then where , and a are non-negative integers and . Since , we have or .
If , then . By a computer calculation is the only solution of this equation. Then , it is clear that or . Also since and , for .
If , then since , the number of Sylow 2-subgroups of G is and so the number of elements of order 2 is 243 but none of which belong to nse(G).
If , then . Since , it follows that the group acts fixed point freely on the set of elements of order . Hence, , which is a contradiction ().
If , then . By a computer calculation, , and are solutions of this equation. Since , we have . We know . It follows that, the number of Sylow 2-subgroups of G is and so the number of elements of order 2 is but none of which belong to nse(G).
Similarly, we can rule out .
Let . Then by Lemma 3, and so (for example when ). We will consider two cases for .
If , then , since , or or , and so , which is a contradiction, and if , since a cyclic group of order 9 has two elements of order 3, , which is a contradiction.
If , then since and , . Therefore, , where , and a are non-negative integers and . Since , we have , , or .
If , then where . By a computer calculation, it is easily seen that the equation has no solution.
If , then where . By a computer calculation, the equation has 22 solutions. For example, . We show this solution is impossible. Since and , it follows that , for . On the other hand, if , then . By Lemma 3, we have , since for , by a computer calculation we have , which is a contradiction. Arguing as above, for other solutions, we have a contradiction.
Similarly, can be ruled out as the above method.
Let . Then by Lemma 3, and so (for example when ( and )). We will consider two cases for .
If , then , since , or or , and so , which is a contradiction, and if , since a cyclic group of order 27 has two elements of order 3, , which is a contradiction.
If , and is not cyclic subgroup, then by Lemma 3, . Since () and (), it is understood that . Since , , and , . Therefore , where , and a are non-negative integers and . Since , we have , , or .
If , then where . By a computer calculation, it is easily seen that the equation has no solution.
If , then where . By a computer calculation, the equation has 22 solutions. For example, . We show this solution is impossible. Since and , it follows that , for . On the other hand, by Lemma 3, we have , since for , by a computer calculation we have , which is a contradiction. Assume is a solution. Since by Lemma 3. Indeed, where , are non-negative integers and . Since , , and , , , and . Since and or 1728, . Also , and thus . By an easy calculation, this is impossible. Arguing as above, for other solutions, we have a contradiction.
If , then where . By a computer calculation, it is easily seen that the equation has no solution.
Let . Then by Lemma 3, and so (for example when (, , and )).
If , then , since , or . If , then which is a contradiction. If , since a cyclic group of order 81 has two elements of order 3, then , which is a contradiction.
☐
Remark 4. According to Lemmas 10 and 11, Remark 3 we have .
Lemma 12. .
Proof. First, we show that
. From the above arguments, we have
. Since
, the group
acts fixed point freely on the set of elements of order 7, and so
. Hence
. Likewise,
, and so
. Hence, we have
. Since
, we conclude that
or
. The proof is completed by showing that there is no group such that
and
. First, we claim that
G is a non-solvable group. Suppose that
G is solvable, since
, by Lemma 7,
, which is a contradiction. Therefore,
G is a non-solvable group and
. Hence,
G has a normal series
, such that
N is a maximal solvable normal subgroup of
G and
is a non-solvable minimal normal subgroup of
. Indeed,
is a non-abelian simple
-group, and so by Lemma 9,
is isomorphic to
or
. Suppose that
. We know
. From Lemma 6, we have
, and so,
for some integer
t. On the other hand, since
and
, we have
,
,
,
, or
. If
, then since
has no integer solution, we have a contradiction. Similarly, if
, we have a contradiction. As a result,
. Hence
, and by assumption,
, so by [
2],
and the proof is completed. ☐
The remainder of this section will be devoted to the proof of Theorem 2.
Proof of Theorem 2. Let
G be a group with
where
is the projective special linear group of degree 3 over field of order 3. The proof will be divided into a sequence of lemmas.
Lemma 13. .
Proof. First, since
, by Lemma 2,
and
. Applying formula (
1), we obtain
. Now, we prove that
. Conversely, suppose that
. Then formula (
1), implies
. From the formula (
1), we conclude that if
, then
. On the other hand, if
, then by Lemma 4,
for some integer
t. Hence
, which is a contradiction and hence
. Since
, the group
acts fixed point freely on the set of elements of order 2 of
G. Hence, by Lemma 8,
, which is a contradiction. In the same manner, we can see that
. Now, we prove
. Conversely, suppose that
. Then formula (
1), implies
. On the other hand, by formula (
1), we conclude that if
, then
. Now, if
, then
, which is a contradiction, and if
,
which is a contradiction. Hence
. Since
, the group
acts fixed point freely on the set of elements of order 2 of
G, and so
., which is a contradiction. Similarly, we can prove that
. From what has already been proved, we conclude that
. ☐
Remark 5. If 3, 13 , then and . If , since , then . By Lemma 3, and so . Suppose . Then since , .Therefore, if , then . Hence, we only have to consider two proper sets , , and finally the whole set .
Now, we will show that is not equal and . For this purpose at first, we need obtain some information about elements of .
If ), then, by formula (1), we have .
By Lemma 3, and so .
If , then .
Lemma 14. and .
Proof. We claim that . Assume the contrary, that is, let . Then . Since, nse(G) has seven elements and , we have a contradiction. Hence .
Our next claim is that . Suppose, contrary to our claim, that . Since , .
Let . Then by Lemma 3, and so . We will consider six cases for .
If , then since , , which is a contradiction.
If , then since and , . Therefore where , and a are non-negative integers and . Since , we have .
If , then since , we have a contradiction. Similarly, we can rule out other cases.
Let . Then by Lemma 3, and (for example when ). We will consider two cases for .
If , then , since , , , or , and so , which is a contradiction, and if , since a cyclic group of order 9 has two elements of order 3, , which is a contradiction.
If , then since , , and , . Therefore where , and a are non-negative integers and . Since , we have or , which is a contradiction.
Let . Then by Lemma 3, and ( for example when and ). We will consider tree cases for .
If , then , since , , or , and so , which is a contradiction, and if , since a cyclic group of order 27 has two elements of order 3, , which is a contradiction.
If , then since , , , and , . Therefore where , and a are non-negative integers and . Since , we have or , which is a contradiction. In the same way, we can rule out the case
Let . Then by Lemma 3, and ( for example when ).We will consider two cases for .
If , then , since , or and so , which is a contradiction. If , since a cyclic group of order 81 has two elements of order 3, then which is a contradiction.
If , since , , , , and , . Therefore, where , and a are non-negative integers and . Since , we have or or , which is a contradiction.
☐
Remark 6. According to Lemmas 13 and 14, and Remark 5, we have .
Lemma 15. .
Proof. We show that . From the above arguments, we have . Since , it follows that, the group acts fixed point freely on the set of elements of order 13, and so . Hence, . Likewise, , and so . and so . Hence, . Likewise, , and so . Hence we have .
Since
, we conclude that
,
,
, or
. The proof is completed by showing that there is no group such that
,
, or
, and
. First, we show that there is no group such that
and
. We claim that
G is a non-solvable group. Suppose that
G is a solvable group, since
, by Lemma 7,
, which is a contradiction. Therefore
G is a non-solvable group and
. Hence,
G has a normal series
, such that
N is a maximal solvable normal subgroup of
G and
is a non-solvable minimal normal subgroup of
. Indeed,
is a non-abelian simple
-group, and so by Lemma 9
is isomorphic to one of the simple
groups. In fact,
. We know
. From Lemma 6, we have
, and so
for some integer
t. On the other hand, since
and
, we have
,
, or
. If
, then since
has no integer solution, we have a contradiction. Similarly, we can rule out the case
and
. Finally, we have to show that there is no group such that
and
. By Lemma 7, it is easy to check that
G is a non-solvable group, and
. Hence,
G has a normal series
, such that
N is a maximal solvable normal subgroup of
G and
is a non-solvable minimal normal subgroup of
. Indeed,
is a non-abelian simple
-group, and so by Lemma 9
is isomorphic to
. Therefore
, which is a contradiction. As a result,
. Hence
and by assumption,
, so by [
2],
and the proof is completed. ☐