An exact upper bound for sums of element orders in non-cyclic finite groups

preprint2016arXivOpen access

Abstract

Denote the sum of element orders in a finite group GG by ψ(G)ψ(G) and let CnC_n denote the cyclic group of order nn. Suppose that GG is a non-cyclic finite group of order nn and qq is the least prime divisor of nn. We proved that ψ(G)≤711ψ(Cn)ψ(G)\leq\frac 7{11}ψ(C_n) and ψ(G)<1q−1ψ(Cn)ψ(G)<\frac 1{q-1}ψ(C_n). The first result is best possible, since for each n=4kn=4k, kk odd, there exists a group GG of order nn satisfying ψ(G)=711ψ(Cn)ψ(G)=\frac 7{11}ψ(C_n) and the second result implies that if GG is of odd order, then ψ(G)<12ψ(Cn)ψ(G)<\frac 12ψ(C_n). Our results improve the inequality ψ(G)<ψ(Cn)ψ(G)<ψ(C_n) obtained by H. Amiri, S.M. Jafarian Amiri and I.M. Isaacs in 2009, as well as other results obtained by S.M. Jafarian Amiri and M. Amiri in 2014 and by R. Shen, G. Chen and C. Wu in 2015. Furthermore, we obtained some ψ(G)ψ(G)-based sufficient conditions for the solvability of GG.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.