On Two Conjectures about the Sum of Element Orders
Morteza Baniasad Azad, Behrooz Khosravi

TL;DR
This paper proves a conjecture linking the sum of element orders to supersolvability in finite groups and provides a counterexample to a related conjecture about subgroup sums.
Contribution
It confirms a conjecture by Trnuceanu connecting the sum of element orders with supersolvability and demonstrates that another proposed inequality does not hold universally.
Findings
Proved that if mbda(G) exceeds a certain bound, G is supersolvable.
Provided a counterexample to the conjecture about mbda(G) for subgroups.
Established limitations of the conjectured inequality in group theory.
Abstract
Let be a finite group and , where denotes the order of . First, we prove that if is a group of order and , where is the cyclic group of order , then is supersolvable. This proves a conjecture of M.~{T\u{a}rn\u{a}uceanu}. Moreover, M. Herzog, P. Longobardi and M. Maj put forward the following conjecture: If , then . In the sequel, by an example we show that this conjecture is not satisfied in general.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On Two Conjectures about the Sum of Element Orders
Morteza Baniasad Azad & Behrooz Khosravi
Dept. of Pure Math., Faculty of Math. and Computer Sci.
Amirkabir University of Technology (Tehran Polytechnic)
424, Hafez Ave., Tehran 15914, Iran
Abstract.
Let be a finite group and , where denotes the order of .
First, we prove that if is a group of order and , where is the cyclic group of order , then is supersolvable. This proves a conjecture of M. Tărnăuceanu.
Moreover, M. Herzog, P. Longobardi and M. Maj put forward the following conjecture: If , then . In the sequel, by an example we show that this conjecture is not satisfied in general.
Key words and phrases:
Sum of element orders, supersolvable group, element orders.
2000 Mathematics Subject Classification:
20D60, 20F16
1. Introduction
In this paper all groups are finite. The cyclic group of order is denoted by . Let , the sum of element orders in a group . The function was introduced by Amiri, Jafarian and Isaacs [2].
Many authors try to get some relations between the structure of the group and (see [7, 8, 9, 11]). Recently it is proved that if , where is a finite group of order , then is solvable [4, 6].
From the observation that satisfies and , in [12] M. Tărnăuceanu put forward the following conjecture:
[T]-Conjecture [12, Conjecture 1.5] If is a group of order and , then is supersolvable.
First, in this paper we prove the validity of this conjecture. Nevertheless, for groups of odd order, it is possible to prove a stronger result:
Theorem 1.1**.**
Suppose that is odd. If , then is supersolvable.
On the other hand, in [6] there exist three conjectures about . The validity of Conjecture 5 was proved in [4] and the validity of Conjecture 6 was proved in [3]. Moreover the following conjecture was posed in that paper.
[HLM]-Conjecture [6, Conjecture 7] If , then .
Finally, in the sequel of this paper we give an example which shows that this conjecture is not satisfied in general and it seems that we need extra conditions on or to have this result.
For the proof of these results, we need the following lemmas.
Lemma 1.2**.**
[2, Corollary B]** Let and assume that and that is cyclic. Then , with equality if and only if is central in .
Lemma 1.3**.**
[6, Proposition 2.6]** Let be a normal subgroup of the finite group . Then .
Lemma 1.4**.**
[1, Lemma 2.1]** If and are finite groups, then . Also, if and only if .
Lemma 1.5**.**
[5, Proposition 2.5]** Let be a finite group and suppose that there exists such that , where is the maximal prime divisor of . Then one of the following holds:
(i) has a normal cyclic Sylow -subgroup,
(ii) is solvable and is a maximal subgroup of of index either or .
Lemma 1.6**.**
[10, Theorem 2.20]** (Lucchini) Let be a cyclic proper subgroup of a finite group , and let . Then , and in particular, if , then .
Lemma 1.7**.**
[4, Lemma 2.1]** Let be a group of order , where are distinct primes. Let , for some integers . Then there exists a cyclic subgroup such that
[TABLE]
Lemma 1.8**.**
[6, Lemmas 2.4 and 2.5]** Let be a positive integer, where are primes, and , for each . If , then
[TABLE]
2. Supersolvability
2.1. Proof of [T]-Conjecture
Let be a group of order , where are primes, such that , for each . By assumption, . By induction on , we prove that is a supersolvable group.
If , then is a -group and so is supersolvable. Assume that and the theorem holds for each group such that . Now we consider the following two cases:
Case (I) If has a normal cyclic Sylow subgroup , then by Lemma 1.2 we have . Using Lemma 1.4 and the assumptions we have
[TABLE]
Therefore and . By the inductive hypothesis, is supersolvable and so is a supersolvable group.
Case (II) Let have no normal cyclic Sylow subgroup.
If , then by Lemma 1.8, we have
[TABLE]
Thus there exists such that . Therefore
[TABLE]
which is a contradiction, by Lemma 1.5. Therefore , where . Now we consider the following cases:
Case 1. Let . Then . In this case we have
[TABLE]
It follows that there exists such that . We conclude that . By Lemma 1.5, we have or . Let .
- •
Let . By Lemma 1.6, . Therefore is supersolvable and so is a supersolvable group.
- •
Let . By Lemma 1.6, . If is a supersolvable group, then we get the result. Let be non-supersolvable. Therefore , and so .
If divides , then there exists a characteristic subgroup in such that . Thus is a non-supersolvable group of order . Therefore using the list of such groups () and their -values (), we have . By Lemma 1.3 we have . Using (1), . Therefore
[TABLE]
which is a contradiction.
If , then . Let . Then there exists a characteristic subgroup in such that . Therefore and . Thus is a non-supersolvable group of order . Therefore using the list of such groups () and their -values (), we have . By Lemma 1.3 we have . On the other hand, we have . Thus
[TABLE]
Therefore
[TABLE]
which is a contradiction. Thus and so and , which is a contradiction, since .
Case 2. Let . Then by Lemma 1.7, there exists such that . By Lemma 1.5, we have . By Lemma 1.6, . We have or . Therefore is supersolvable and so is a supersolvable group.
Case 3. Let . Then by Lemma 1.7, there exists such that , which is impossible.
Case 4. Let or . Then by Lemma 1.7, there exists such that , which is a contradiction
Case 5. Let , , , or . Then by Lemma 1.7, there exists such that and we get a contradiction.
The proof is now complete.
2.2. Equality condition of [T]-Conjecture
Lemma 2.1**.**
Let be a non-supersolvable group of order and . Furthermore, let and is cyclic and normal in . Then has a normal -complement in , where .
Proof.
By Lemma 1.2, we have
[TABLE]
Therefore
[TABLE]
Now by the non-supersolvability of G and the above result, we conclude that
[TABLE]
It follows that the equality holds in (2). Thus , by Lemma 1.2. Therefore by Burnside’s normal -complement theorem, there exists such that ∎
Theorem 2.2**.**
Suppose that is a non-supersolvable group of order such that . Then , where .
Proof.
Let be the largest prime divisor of . We prove the result by induction on . By the assumption, , and so .
- (1)
Let .
We note that has no normal cyclic Sylow subgroup. There exists such that . By Lemma 1.5, we have or . If , then is a supersolvable group, which is a contradiction. Therefore . We have , since is non-supersolvable. If , then similarly to Case 1 in the proof of [T]-Conjecture we get a contradiction. Therefore and so . 2. (2)
Let .
- (a)
Let .
Then by Lemma 1.7, there exists such that . By Lemma 1.5, has a normal cyclic Sylow -subgroup or .
Let has a normal cyclic Sylow -subgroup, say . Using Lemma 2.1, there exists such that and . We notice that is non-supersolvable and . By the above case, we have and .
Let . Then or . Therefore is supersolvable and so is a supersolvable group, which is a contradiction. 2. (b)
Let or . Then there exists such that . By Lemma 1.5, has a normal cyclic Sylow -subgroup. Thus is a supersolvable group, which is a contradiction. 3. (3)
Let .
Then there exists such that . By Lemma 1.5, has a normal cyclic Sylow -subgroup. Using Lemma 2.1, there exists such that and . We notice that is non-supersolvable and or , therefore by the above cases we have or , respectively and we get the result. 4. (4)
Let . Then there exists such that
[TABLE]
By Lemma 1.5, has a normal cyclic Sylow -subgroup, say . Using Lemma 2.1, there exists such that and . Then is non-supersolvable and . Therefore using the above discussion and the induction hypothesis we get the result.
∎
2.3. Supersolvability for group of odd order
Notation 2.3**.**
Let be the set of all primes in an increasing order: . Let also . If are two positive integers, we define the functions and as follows:
[TABLE]
[TABLE]
In the sequel, let . We know that and . Similarly to the proof of Lemmas 2.4 and 2.5 in [6] we get that:
Lemma 2.4**.**
Let be a positive integer, where are primes, and , for each . If , then
[TABLE]
The proof of Theorem 1.1 is very similar to the proof of [T]-conjecture, and so we remove the details of the proof.
Proof of Theorem 1.1.
We prove the result by induction on . The assertion is trivial if is a -group, and let the result holds for each group , where (exactly similar to the proof of [T]-Conjecture).
We consider the following two cases:
Case(I) If has a normal cyclic Sylow subgroup , then we get the result.
Case (II) Let have no normal cyclic Sylow subgroup.
Let be the largest prime divisor of . If , then by Lemma 2.4, we have
[TABLE]
Thus there exists such that . Therefore
[TABLE]
which is a contradiction.
Therefore and so . Now we consider the following cases:
Case 1. Let , i.e. .
Using Lemma 1.7, there exists such that . By Lemma 1.5, we have . Using Lemma 1.6, . We see that is supersolvable and so is a supersolvable group.
Case 2. Let . Similarly to Case 1 we obtain that is a supersolvable group.
Therefore , where .
Case 3. Let . If , then by Lemma 1.7, there exists such that . Thus by Lemma 1.5 we have , and we get the result similarly to the above. If , by Lemma 1.7, there exists such that , and by Lemma 1.5 we have or .
If , then by Lemma 1.6 we have , where . Therefore is a supersolvable group and so is a supersolvable group.
If , then by Lemma 1.6 we have . If , then . Let . We have and , which is a contradiction. Therefore . Let . We have and , which is a contradiction.
Case 4. Let .
If then there exists such that . Therefore or .
If , then we have the result.
Let . Then , where . If , then we get the result. Otherwise, has a Sylow -subgroup which is cyclic and normal, and this is impossible.
If , then there exists such that . Therefore and so we have the result.
Case 5. Let .
If or , then easily we can see that is supersolvable.
If , then there exists such that . Therefore or .
If , then we get the result.
Let . Then , where . If , then we get the result. Otherwise, the Sylow -subgroup of is cyclic and normal, which is impossible.
Let . Then , where . If , then we get the result. Otherwise, the Sylow -subgroup of is cyclic and normal, which is impossible.
Case 6. Let . Then . In this case we have
[TABLE]
Hence there exists such that . By Lemma 1.5, we have or . If , then we have the result. Let and . By Lemma 1.6, . If is a supersolvable group, then we get the result. Let be non-supersolvable. Therefore and . Thus .
If divides , then there exists a characteristic subgroup in such that . Therefore and . Thus is a non-supersolvable group of order . Therefore using the list of such groups () and their -values (), we have . By Lemma 1.3 we have . Using (3), . Therefore
[TABLE]
which is a contradiction.
If , then . Let . Then there exists a characteristic subgroup in such that . Therefore and . Thus is a non-supersolvable group of order . Therefore using the list of such groups () and their -values (), we have . By Lemma 1.3 we have . Using (3), we have
[TABLE]
which is a contradiction. Thus and so , which is a contradiction. ∎
3. Counterexample for [HLM]-Conjecture
Using the notation in GAP, let , where . We know that has a maximal subgroup . Therefore has a maximal subgroup . Using GAP we have and and so . Now note that
[TABLE]
Therefore this example shows that [HLM]-Conjecture is not satisfied in general. Obviously this is a natural question to ask with which extra conditions the validity of [HLM]-Conjecture is obtained.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H. Amiri, S.M. Jafarian Amiri, Sum of element orders on finite groups of the same order, J. Algebra Appl. , 10(2) (2011) 187–190.
- 2[2] H. Amiri, S.M. Jafarian Amiri, I.M. Isaacs, Sums of element orders in finite groups, Comm. Algebra , 37(9) (2009) 2978–2980.
- 3[3] A. Bahri, B. Khosravi, Z. Akhlaghi, A result on the sum of element orders of a finite group, ar Xiv:1904.00425 .
- 4[4] M. Baniasad Azad, B. Khosravi, A criterion for solvability of a finite group by the sum of element orders, J Algebra , 516 (2018) 115–124.
- 5[5] M. Herzog, P. Longobardi, M. Maj, An exact upper bound for sums of element orders in non-cyclic finite groups, J. Pure Appl. Algebra , 222 (7) (2018) 1628–1642.
- 6[6] M. Herzog, P. Longobardi, M. Maj, Two new criteria for solvability of finite groups, J Algebra , 511 (2018) 215–226.
- 7[7] M. Herzog, P. Longobardi, M. Maj, Properties of Finite and Periodic Groups Determined by their Element Orders (A Survey), Group Theory and Computation, Springer, Berlin (2018).
- 8[8] M. Herzog, P. Longobardi, M. Maj, Sums of element orders in groups of order 2 m 2 𝑚 2m with m 𝑚 m odd, Comm. Algebra , (2019) 1–14.
