Abstract
Let G be a finite group. In this paper, we study how certain arithmetical conditions on the conjugacy class lengths of real elements of G influence the structure of G. In particular, a new type of prime graph is introduced and studied. We obtain a series of theorems which generalize some existed results.
1. Notation and Introduction
Throughout this paper, the terminology is as follows. All groups are finite and G refers to a group. By a primary element x and a primary -element y for a prime number p, we mean that for an arbitrary prime r and for some prime . Recall that an element g of G is said to be in G if g and are conjugate in G, i.e., there is an such that , and as usual the conjugacy class of the real element g, , is called a real class of g. We denote by , , , and the conjugacy class of , the length of , the set of real elements of G, and the set of real primary elements of G, respectively. We denote by the number of connected components of a graph . Define the set and , where p is an arbitrary prime number}. That is, is the set of real primary elements and real biprimary even order elements of G. Let , and denote the set of conjugacy classes, the set of real conjugacy classes, the set of conjugacy classes , where , of G, respectively. We denote by , , and the set , , and , respectively. Other notation will be explained in due time.
The prime graphs are useful tools for intuitively reflecting the structure of groups, and the investigation of them are still underway. The prime graph related to , denoted by (introduced by Alfandary in [1] as ), is a simple graph with vertex set the set of primes dividing the length of some and there is an edge between two vertices p and q if and only if the product divides the length of some . Prime graphs related to a subset of classes of a group is constructed in the same way. Let be the prime graph related to ( introduced by Dolfi in [2] as ).
The influence of conjugacy class lengths on the structure of groups has been extensively studied in the past two decades (see [3,4,5,6]). In particular, the problems of recognizing the solvability of G and the existence of normal (or abelian) p-complements of G in this context have been widely investigated, which are also the major themes of our discussion here. Recently, some authors do their research by placing conditions on only real classes of G. Fruitful achievements are obtained in this line of study, and it turns out that the lengths of these classes are closely related to some fundamental properties of G, see, for instance, [2,7,8]. The new techniques developed in those papers are valuable and some analogue methods are employed in this article.
Now, we mention several notable findings related to real classes. In ([8], Theorem 4.2), Tong-Viet proved that, if the class length of every real primary -element of G is either a 2-power or not divisible by 4, then G is solvable. It was shown in ([2], Theorem 6.1) that 2 is not a vertex of if and only if G has a normal Sylow 2-subgrpup S (i.e., G is 2-closed) and ReZ. For odd primes, the outcomes are not that satisfactory. Furthermore, it follows from ([9], Theorem B) that, if the prime graph of G is disconnected, then 2 must be a vertex of . These facts confirm repeatedly the importance and the special position of the prime 2 in the study of real classes in groups.
Based on the above observations, in this article, we consider the set for G, which are defined earlier, and introduce the prime graph related to the classes of elements of , i.e., . Precisely, is the graph with vertex set , for some , and edge set for some .
We pay the majority of attention to class lengths of elements of in Section 3 and of in Section 4, respectively, and characterize G of which these lengths have some arithmetical properties. In Section 5, the properties of the prime graph that we defined and the relation to the structure of G are examined. In this paper, we obtain improvements and variations of some existed results.
2. Preliminaries
We will need some results on conjugacy classes, and in particular, on real classes.
Lemma 1.
Let . Then, for all , and for all .
Lemma 1 is well known, and we will use it without further reference.
Lemma 2
([9], Lemma 2.1). (a) If and is odd, then .
(b) If , then every power of x is a real element of G.
(c) If , then for some 2-element .
(d) If and is odd, then .
Lemma 3
([10], Lemma 2.5). Let be such that .
(a) Assume . Then, . If in addition x and y are in , then .
(b) If , or if and are normal in G and have trivial intersection, then , and therefore .
Lemma 4
([10], Proposition 2.8). Let A be a group of odd order that acts faithfully on a nontrivial elementary abelian 2-group V of order . Assume that . Then, the following conditions are equivalent:
(a) For every nontrivial , is a prime number.
(b) There exists a prime p such that, for every nontrivial , .
Lemma 5
([2], Proposition 6.4). The following are equivalent:
(a) Every nontrivial element in has even order;
(b) Every element in is a 2-element;
(c) G has a normal Sylow 2-subgroup.
Lemma 6
([10], Lemma 3.3). Let x be a nontrivial real odd order element of G. If has prime length q, then and . Furthermore, for every nontrivial , we have .
The next Lemma gives a neat description of the structure of G when .
Lemma 7
([10], Theorem 3.4). Let p be an odd prime. Then, if and only if , where H is a dihedral group of order and .
Lemma 8 and 9 are for inductive purposes.
Lemma 8
([7], Lemma 2.2). Suppose that N is a normal subgroup of G and . If or the order of in is odd, then for some real element y of G (of odd order if the order of is odd).
Lemma 9.
Let π be a set of some primes and N a normal subgroup of G.
(a) ([11], Lemma 2.3) If is a π-element, then there exists a π-element of G such that .
(b) If or the order of in is odd, and is a real π-element, then there exists a real π-element of G such that .
Proof.
(b) By Lemma 8, there exists a real element y of G such that . Clearly, we can write , where is a -element and is a -element. As the order of is the product of the orders of and , we have ; therefore, . Since is some power of y, by Lemma 2(b), is real in G. Choose will meet the conclusion. □
Lemma 10.
Let p be a prime and such that . Then, for all non-central .
Proof.
Let be non-central and let and such that . Since , then . In particular, . It follows that and . Therefore, and hence is also a Sylow p-subgroup of . Thus, , and then . □
Lemma 11.
Suppose that has two connected components with vertex sets and , where . Then, there exists an involution such that is a -number and has a normal Sylow 2-subgroup.
Proof.
Let p be a prime in . Then, p must divide for some . Clearly, every prime divisor of is adjacent to ; this implies that is a nontrivial -number. Hence, is odd and so by Lemma 2(a) and thus i is an involution of G.
Assume that has a nontrivial real element x of odd order. By Lemma 2(b), we can assume that , where q is an odd prime. Then, and is even, so is a -number and thus . Lemma 3(a) implies that is a real element. Furthermore, since , by Lemma 3(b). Since , . Then, and are adjacent in , and we get a contradiction. Therefore, has no nontrivial real element of odd order and thus it has a normal Sylow 2-subgroup by Lemma 5. □
We close this section with the remark that trivial class is the only real class of G if and only if G has odd order ([10], Lemma 2.4(iii)), and therefore G has no nontrivial real primary elemnet if and only if G has odd order.
3. The Lengths of Real Classes
In ([10], Theorem A), Dolfi proved that G is solvable if all noncentral real classes of G have prime size, and, furthermore, is contained in a set of the kind , or , where p is an odd prime. We show that similar conclusions are true under more general conditions.
We begin with Theorem 1, and a basic result of this section which is the reasoning behind several other results. It shows that the properties of certain real elements can determine those of all the real elements in some ways:
Theorem 1.
(1) Every is a 2-element if and only if every is a 2-element.
(2) Let p be an odd prime, then if and only if .
(3) Let p be an odd prime, then if and only if .
Proof.
(1) Necessity being clear. Assume that every primary real element of G is a 2-element, and let . We can factor g as , where each element has distinct prime power orders and commute pairwise. By Lemma 2(b), all ’s are real in G, and therefore, by hypothesis, they are all 2-elements. Thus, g is a 2-element, as required.
(2) First, assume that . Let , then we can write where each element have distinct prime power orders and commute pairwise. If , then all the ’s are central in G, so g is central in G and . We conclude that , a contradiction. If , then, by Lemma 3(b), it is easy to get and so . Since g is arbitrary, we get , a contradiction too. Thus, .
Conversely, assume that . For every , we have or p, in each case, by Lemma 2(a), we have . Now, by (1), we see that every is a 2-element. By assumption or p, and therefore , the claim follows.
(3) Assume that , by Lemma 7 we get where H is a dihedral group of order and . Notice that, for , we have , and , and it follows that .
Conversely, assume that . If no nontrivial primary real element of G has an odd order, then it is easy to see that every real element has an even order. Lemma 5 yields that G has a normal Sylow 2-subgroup D, and by Lemma 2(d). That is, , and the claim follows. Therefore, we may assume that there exists a nontrivial primary real element x of G having odd order, and clearly .
Let . By Lemma 6, for every , has index 2 in G. Choose element such that . Observe that z is an involution by Lemma 2(a). Now, if any centralizes z, then, by Lemma 3, it is easy to see that and . This is a contradiction by hypothesis. Therefore, . In particular, and hence is a complement of M in G. Furthermore, as and , it follows that and that . In other words, every nontrivial real primary element of G having an odd order must have order p.
Let , write , where all the ’s are real in G and commute pairwise; in addition, and for , where ’s are odd primes. By the preceding conclusion, we must have for . It follows that , and therefore . Thus, assertion follows. □
With Theorem 1 in mind, we found that some existed results can be restated in forms that are a little more general. For instance, considering Lemma 5 and 7, we have the following two corollaries. Corollary 1 describes the groups with all the real primary elements being 2-elements.
Corollary 1.
The following are equivalent:
(1) Every element in is a 2-element.
(2) G has no nontrivial real primary -element.
(3) G has a normal Sylow 2-subgroup.
Corollary 2 characterizes the structure of G such that the lengths of classes for every noncentral is either 2 or p, where p is a fixed odd prime.
Corollary 2.
Let p be an odd prime. Then, if and only if where H is a dihedral group of order and .
Theorem 6.1 in [2] states that all real classes of G have odd lengths if and only if G has a normal Sylow 2-subgroup P and . Here is a similar result.
Theorem 2.
Let P be a Sylow 2-subgroup of G. Then, all classes of elements of have odd lengths if and only if and .
Proof.
By Theorem 6.1 in [2], we need only show that, if all classes of elements of have odd lengths, then so do the real classes of G. Let the class lengths of all are odd numbers. We then have for all , and it is easily seen that all the elements of must be 2-elements. The claim follows by assumption. □
The next theorem is another basic result of Section 3, and arguments analogous to those of [10] are used in the proof.
Theorem 3.
Assume that is either a 2-power or an odd prime for every . Then, G is solvable, and there exists an odd prime p such that is either a 2-power or p for every .
Proof.
By ([8], Theorem 4.2), we know that G is solvable.
Assume first that G has a normal Sylow 2-subgroup D, and set is odd⟩. Observe that, by Lemma 2(a), U is an elementary abelian 2-subgroup which is a subgroup of Z. Moreover, we have . Let . Then, is odd and, by Fitting’s Lemma (see ([12], Theorem 4.34), , where . Note that A acts faithfully on V and that . Every nontrivial is an involution, so and is either a power of 2 or an odd prime by hypothesis. However, since , we have is an odd prime. Then, by Lemma 4, there exists an odd prime p such that for every nontrivial . Now, if and is an odd prime, then for suitable elements and , and hence . We see that, in this case, the theorem is proved.
We now assume that G does not have a normal Sylow 2-subgroup. Thus, by Lemma 5, there exists a nontrivial element of odd order. Observe that, by Lemma 2(b), we can assume , where p is an odd prime. By Lemma 2(a), is even, and hence is a power of 2 by hypothesis. Now, let be such that is an odd prime. Applying again Lemma 2(a), we see that y is an involution.
If we assume , then contains a Sylow p-subgroup of G; therefore (by a suitable choice of y), we can assume that contains x. As and have a coprime index in G, by Lemma 3 we have and , where n is a positive integer. Since , so , by hypothesis, this is a contradiction. It follows again that is either a power of 2 or p for every . □
With minor changes in the preceding proof, we can prove the following corollary.
Corollary 3.
Assume that is a prime for every . Then, G is solvable, and there exists a prime p such that .
4. The Class Lengths of Primary Real Elements
Recognizing p-nilpotency (i.e., has a normal p-complement or not) is clearly an important problem. In this section, we provide some evidence for a conjecture proposed in [8], which said that, if the lengths of all the nontrivial real classes in G have the same 2-part, then is 2-nilpotent; in particular, G is solvable. In Theorem 4, we prove that, with only real classes of primary elements being considered, this conjecture is held under some condition on the Sylow 2-subgroups.
In ([13], Theorem 3.4), Navarro et al. showed that all real class lengths of G are powers of 2 if and only if G has a normal 2-complement K and . However, when p is an arbitrary prime, the situation for the existence of a normal p-complement is different. We also remark that, in ([14], Lemma 2.2), Chen and Zhao proved that, if is a p-number for every primary -element x of G, then G is a solvable group with abelian p-complements. Here, we obtain Theorem 5 as an analogous result.
At the end of this section, a particular class of groups is concerned, namely, the P-groups. For every subgroup H of G, if where , then G is said to satisfy the permutizer condition P, or to be a P-group. In [15], the authors proved that P-groups are solvable by making use of the Classification Theorem of Finite Simple Groups (CFSG), they also proved that every maximal subgroup of a P-group has index 4 or a prime. It is meaningful to consider how close such groups come to being supersolvable.
Theorem 4.
Suppose that for all non-central . Assume further that G has a Sylow 2-subgroup S with . Then, G is solvable and is 2-nilpotent.
Proof.
We first prove that G is solvable. Let G be a counterexample of minimal order. Then, G is non-solvable and has no normal Sylow 2-subgroup. By Corollary 1, there exists a nontrivial real primary -element . Clearly, and so is even. Thus, . That is, for all non-central .
Now we claim that every nontrivial real 2-element of lies in the center of . Let be a nontrivial real 2-element of . By Lemma 9(b), there exists a real 2-element y of G such that . Considering y, we have for some 2-element by Lemma 2(c). Write . Since t normalizes , U is a 2-subgroup of G. We have for some by the Sylow theorem. We want to show that is a central involution of G. Notice that, if is a central involution of G, then so is y. Therefore, we may assume that . Since , then , so it follows easily that y is an involution and is odd. However, by the first paragraph, is even if y is not central, and this forces . We conclude that y is a central involution of G, hence is also a central involution of , and the claim follows.
Since , by ([16], the main theorem), the last term of the derived series of is isomorphic to , where each is isomorphic to either with odd number , or , the perfect double cover of . We claim that, for some i, there exists a real element a of , and therefore of , such that . First, assume that for some i. Using [17], has a real element of order 4. Next, assume that with odd number . As we know (see ([18], Theorem 2.8.3)), the Sylow 2-subgroup S of is a generalized quaternion group of order . From its presentation , we obtain a real element a of of order . Of course, a is also real in as is a subgroup of . The claim follows. a must lie in the center of , which yields . Notice that for all , and we get a contradiction. Therefore, G is solvable.
Suppose that . Using Lemma 10 where we let and , we see that for all non-central and by induction is 2-nilpotent. Hence, we may assume that . Let and use bar as the customary. Let . has a Hall -subgroup since it is solvable. By the second paragraph, we see that every nontrivial real 2-element of lies in . This means that the conjugation action of on fixes all real elements of order 2 or 4, and then centralizes by ([19], Theorem B). By ([12], Theorem 3.21), we get , which yields . Hence, is a 2-group and we conclude that G is 2-nilpotent. □
Theorem 5.
Let p be a prime, a power of p for every 2-element, and every p-element x of G, and also for every real primary -element x of G. Then, G has a normal p-complement.
Proof.
First, by ([8], Theorem 4.2), we see that G is a solvable group. Next, we show that G has a normal p-complement by induction on . Let and M be a normal maximal subgroup of G. Then, a prime. Note that and for all , By induction, we know that M has a normal p-complement H. Hence, we may assume that .
Let . We claim that inherits the hypothesis on G. Let be a p-element (2-element, resp. ) of . By Lemma 9(a), there exists a p-element (2-element, resp. ) of G such that . Therefore, , which yields that is a p-power. Let be a real primary -element of , and we can assume that for some prime , since otherwise, by hypothesis and Lemma 9(a), we easily get that is a power of p. By Lemma 9(b), there exists a real r-element of G such that . Hence, ; again, is also a power of p. The claim follows. Now, if , then has a normal p-complement by induction, and therefore G has a normal p-complement.
Based on the above, we may assume that . In particular, . Now, let K be a Sylow q-subgroup of G. We have that K acts coprimely on P. We claim that every element of P is K-invariant. Let . Then, is a p-power since x is a p-element of G. Therefore, there exists such that . Then, , and we deduce that the conjugacy class is K-invariant. It follows that the action of K on P induces an action of K on the classes in P, and, for every class C in P, K fixes some element of C, say . Set . Clearly, K acts trivially on J. Since J contains an element from each class in P, we get . Hence, and the action of K on P is trivial, which implies that G has a normal p-complement K. This completes the proof. □
Remark 1.
When , Theorem 5 still holds of course.
By the inductive method and utilizing the properties of P-groups mentioned before, we give a sufficient condition for a P-group to be supersolvable. It seems that to date that there is no similar result of this kind.
Theorem 6.
Let G be aP-group. Suppose that for every 2-element and every real primary element . Then, G is supersolvable.
Proof.
Assume that the theorem is false and let G be a counterexample. Thus, G is not supersolvable.
If every maximal subgroup of G has index a prime, then G is supersolvable. Hence, G has a maximal subgroup M such that . Therefore, is even. Since G is a P-group, G is solvable by the preceding remarks. There exists a minimal normal subgroup N of G such that N is elementary abelian of order where p is a prime. Consider . It can be shown that is a P-group. We may suppose that , since, otherwise, G is supersolvable as required. Let be a real primary -element of , by Lemma 9(b), there exists a real primary -element of G such that . We see that , which yields . On the other hand, let be a 2-element of ; by Lemma 9(a), it is easy to deduce that . This shows that inherits our hypothesis and thus is supersolvable. Note that the class of finite supersolvable groups is a saturated formation, hence and N is the unique minimal normal subgroup of G. From these facts, we obtain a maximal subgroup M of G such that and . Since is a prime or 4, we must have , that is, .
Consider the permutation representation of G on M. We see that G is isomorphic to a subgroup of . Hence, or since G is not supersolvable. Furthermore, it is easy to check that is not a P-group, so . We remark that every element of is real. Now, for an element x of order 3, for example, permutation , since , we have , a contradiction to our hypothesis. Therefore, we conclude that G is supersolvable. □
Remark 2.
By Lemma 9(b), for real 2-elememts, the inductive method may not work out when applied to quotient groups; therefore, assumptions for (not real) 2-elements are needed in Theorems 5 and 6.
5. The Prime Graph
The implications of the class lengths of G on the structure of G can be studied via prime graphs. Interestingly, prime graphs related to different subsets of classes exhibit some similarities in their graphic features. For instance, it was shown that and for any group G (see [1,2]). In addition, if G is a p-solvable group, where is the prime graph related to the set of classes of -elements of G (see [20]).
By the proof of Theorem 2, the condition that all the elements of have odd number class lengths is equivalent to saying that all the elements of , and therefore of , have odd number class lengths, hence Theorem 2 shows that 2 is not a vertex of if and only if G has a normal Sylow 2-subgroup P and .
Our Theorem 7 determines the number of connected components of the prime graphs , and the finding is consistent with those regarding and . For convenience, let be a non-central element, and we denote by the connected component of that contains the set of vertices , and the connected component of which q belongs to, where q is a prime.
Considering , by ([9], Theorem 3.4), we have that G is solvable if is disconnected. It is tempting to wonder wether the corresponding conclusion for is valid or not. However, we are unable to prove or disprove this yet. Nevertheless, for a very restrictive case, we have Theorem 9, the proof of which is via a series of lemmas and theorems, in particular, Theorem 7 and 8 are employed.
Theorem 7.
For any group G, .
Proof.
Working by contradiction, let G be a group of minimal order such that .
Assume first that there exists a nontrivial element of odd order . By taking a suitable power, we can assume that with p an odd prime. By Lemma 2(a), we have . Since , there is a connected component of with and . Choose such that . Because , y is an involution. Furthermore, as , y commutes with a Sylow p-subgroup of G and, up to conjugation, we can assume that x and y commute. Note that , so, by Lemma 3, we get the contradiction .
We see that all elements of are 2-elements, and so are all elements of . Hence, by Lemma 5, G has a normal Sylow 2-subgroup P. In particular, G is solvable by the Feit–Thompson theorem. Let N be a maximal normal subgroup of G containing P. Then, an odd prime and by Lemma 2(d). If , then . By minimality, , and this implies that a connected component of must consist of the single prime q, and . Thus, if and , then is a q-power and . In addition, by Lemma 2(a), g is an involution.
Let . Since P lies in the kernel of the action of N on Z, we have the decomposition , with , . Let with . Then, . Observe that , as otherwise every real class of elements of that has an odd length would have q-power length and hence . Let be an involution. Then, from and , we obtain , so, by Lemma 3(a), it follows . Of course, . Since x and y lie in normal subgroups of G which intersect trivially, we get and therefore . This gives , a contradiction. □
If , by the fact that , we easily see that is a subgraph of . However, it may not be true that is a subgraph of . However, this is the case if is odd.
Lemma 12.
Let with odd. Then, is a subgraph of .
Proof.
First, we argue that . Let and let such that . By Lemma 9(b), there exists an element such that . Since , and .
With a similar argument, we can prove that, if there are two different vertices , adjacent in , then are adjacent in by using Lemma 9(b) again. Thus, is a subgraph of . □
Let H be a subgroup or a quotient group of G. Assume that is a subgraph of , and is also disconnected having two connected components with vertex sets and , respectively. To show that is disconnected, it suffices to show that for , or, equivalently, there exists two elements of such that for .
Theorem 8.
Suppose that, for a group G, has two connected components with vertex sets and , where . Then:
(1) If G is not 2-closed and with odd, then is disconnected.
(2) If with odd and assuming further that is not 2-nilpotent, then is disconnected.
Proof.
By Lemma 11, G has an involution i such that is a -number and has a normal Sylow 2-subgroup S.
For (1), let with being odd. We have . Notice that, if M is 2-closed, then G is also 2-closed, hence we may assume that M is not 2-closed. By Theorem 2, 2 divides the class length of some element of and hence . Now, M contains every real element of G by Lemma 2(d); then, . If , then as is odd, so M is 2-closed, a contradiction. Thus, and then . As is a subgraph of and for each , we conclude that is disconnected.
For (2), let with being odd. By Lemma 12, is a subgraph of . In particular, . If is 2-closed, then is of an odd index, thus since . In other words, G is 2-nilpotent, by hypothesis, this is a contradiction. Hence, we may assume that is not 2-closed.
The element is clearly an involution. If , we have , where the latter equality follows from ([12], Lemma 7.7). Hence, is a normal Sylow 2-subgroup of , a contradiction. Therefore, and , so . On the other hand, as is not 2-closed, by Theorem 2, again . We conclude that is disconnected. □
Finally, recall that the famous Feit–Thompson Theorem from 1963 states that every group of odd order is solvable. Therefore, we know that G is solvable if where r is a prime by ([12], Theorem 1.35). This conclusion as well as some arguments similar to those in the proof of ([9], Theorem 3.4) are applied to get the following theorem.
Theorem 9.
Let , where and r is an odd number; if is disconnected, then G is solvable.
Proof.
Let G be a counterexample with minimal order. Then, G is non-solvable and is disconnected. By Theorem 7, we get that has exactly two connected components with vertex sets and , respectively. We can assume that G has no normal Sylow 2-subgroup, since, otherwise, by the Feit–Thompson theorem, G is solvable. By Corollary 1, G has a nontrivial real primary -element x. Then, is even and hence . We assume that . Therefore, all vertices in are odd primes. We divide the remaining proof into three parts.
(1) G is not a non-abelian simple group.
By Lemma 11, there exists an involution such that is a -number and has a normal Sylow 2-subgroup, say S. As is odd, S is also a Sylow 2-subgroup of G. Notice that is solvable. Now, for a real primary -element , is even and so it is a number. Thus, . It follows from ([21], Theorem 2) that G is not a non-abelian simple group:
(2) and .
Since G is not 2-closed, by Theorem 8(1), is disconnected. If , then is solvable by the minimality of . Therefore, G is solvable since is solvable, a contradiction. Thus, .
Since G is not solvable, is not 2-nilpotent. Hence, by Theorem 8(2), is disconnected. If is nontrivial, then, by the minimality of , we get is solvable, and so is G. Thus, we must have .
(3) The final contradiction.
Let M be a maximal normal subgroup of G. If , then, by hypothesis, and M must be solvable (see ([12], Theorem 1.35)), and so is G, a contradiction. The remaining cases where or both contradict (2). □
6. Conclusions
By mainly considering the lengths of a portion of real classes, and using the prime graph in particular, we obtain some information about the structure of G. We show that even this small subset of the set , with other proper conditions in occasional cases, still encodes a lot of structural information on G. This served as a background to continue the investigation of the influence of real elements and also the lengths of certain real classes on the structure of groups.
On the other hand, many authors have been inspired by looking at connections between characters and conjugacy classes, and, of course, between real characters and real classes (see [2,22,23,24]). Our works may shed some light on this research.
Author Contributions
Investigation, writing original draft: S.Y.; supervision, review and editing: X.L. Both authors have read and agreed to the published version of the manuscript.
Funding
This research was funded by the National Natural Science Foundation of China (Grant No. 11871360).
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Alfandary, G. On graphs related to conjugacy classes of groups. Israel J. Math. 1994, 86, 211–220. [Google Scholar] [CrossRef]
- Dolfi, S.; Navarro, G.; Tiep, P.H. Primes dividing the degrees of the real characters. Math. Zeit. 2008, 259, 755–774. [Google Scholar] [CrossRef]
- Beltrán, A.; Felipe, M.J. Some class size conditions implying solvability of finite groups. J. Group Theory 2006, 9, 787–797. [Google Scholar] [CrossRef]
- Guralnick, R.M.; Navarro, G. Squaring a conjugacy class and cosets of normal subgroups. Proc. Amer. Math. Soc. 2016, 144, 1939–1945. [Google Scholar] [CrossRef]
- Bianchi, M.; Brough, J.; Camina, R.D.; Pacifici, E. On vanishing class sizes in finite groups. J. Algebra 2017, 489, 446–459. [Google Scholar] [CrossRef][Green Version]
- Felipe, M.J.; Martínez-Pastor, A.; Ortiz-Sotomayor, V.M. Square-free class sizes in products of groups. J. Algebra 2017, 491, 190–206. [Google Scholar] [CrossRef]
- Guralnick, R.M.; Navarro, G.; Tiep, P.H. Real class sizes and real character degrees. Math. Proc. Camb. Philos. Soc. 2011, 150, 47–71. [Google Scholar] [CrossRef]
- Tong-Viet, H.P. Groups with some arithmetic conditions on real class sizes. Acta Math. Hungar. 2013, 140, 105–116. [Google Scholar] [CrossRef][Green Version]
- Tong-Viet, H.P. Real class sizes. Israel J. Math. 2018, 228, 753–769. [Google Scholar] [CrossRef]
- Dolfi, S.; Pacifici, E.; Sanus, L. Finite groups with real conjugacy classes of prime size. Israel J. Math. 2010, 175, 179–189. [Google Scholar] [CrossRef]
- Guo, X.; Zhao, X.; Shum, K.P. On p-regular G-conjugacy classes and the p-structure of normal subgroups. Comm. Algebra 2009, 37, 2052–2059. [Google Scholar] [CrossRef]
- Isaacs, I.M. Finite Group Theory; Graduate Studies in Mathematics; AMS: Providence, RI, USA, 2008; Volume 92. [Google Scholar]
- Navarro, G.; Sanus, L.; Tong-Viet, H.P. Real characters and degrees. Israel J. Math. 2009, 171, 157–173. [Google Scholar] [CrossRef]
- Chen, R.; Zhao, X. A criterion for a group to have nilpotent p-complements. Monatsh. Math. 2016, 179, 221–225. [Google Scholar] [CrossRef]
- Beidleman, J.C.; Robinson, D.J.S. On finite groups satisfying the permutizer condition. J. Algebra 1997, 191, 686–703. [Google Scholar] [CrossRef][Green Version]
- Griess, R.L. Finite groups whose involutions lie in the center. Quart. J. Math. 1978, 29, 241–247. [Google Scholar] [CrossRef]
- Conway, J.H.; Curtis, R.T.; Norton, S.P.; Parper, R.A.; Wilson, R.A. Atlas of Finite Groups; Oxford University Press: Eynsham, UK, 1985. [Google Scholar]
- Gorentein, D. Finite Groups, 2nd ed.; Chelsea Publishing Company: New York, NY, USA, 1980. [Google Scholar]
- Isaacs, I.M.; Navarro, G. Normal p-complements and fixed elements. Arch. Math. 2010, 95, 207–211. [Google Scholar] [CrossRef]
- Lu, Z.; Zhang, J. On the diameter of a graph related to p-regular conjugacy classes of finite groups. J. Algebra 2000, 231, 705–712. [Google Scholar] [CrossRef][Green Version]
- Fisman, E.; Arad, Z. A proof of Szep’s conjecture on nonsimplicity of certain finite groups. J. Algebra 1987, 108, 340–354. [Google Scholar] [CrossRef][Green Version]
- Liu, X. On lengths of conjugacy classes and character degrees in finite groups. Comm. Algebra 2006, 34, 1443–1449. [Google Scholar] [CrossRef]
- Dan, R. Finite groups with three rational conjugacy classes. Arch. Math. 2007, 110, 1–10. [Google Scholar]
- Robati, S.M. Real-imaginary conjugacy classes and real-imaginary irreducible characters in finite groups. Math. Notes 2018, 103, 251–258. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 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/).