2022/08/10 by Hiranya Kishore Dey, Dey, Hiranya Kishore, Archita Mondal +1 · 1 citation
Computer Science · Mathematics · #20D60 #20E34 #20F18 #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR)
paper · pdf · doi:10.48550/arxiv.2208.05161
openalex publication_date 2022/08/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For a finite group G, let ψ(G) denote the sum of element orders of G. This function was introduced by Amiri, Amiri, and Isaacs in 2009 and they proved that for any finite group G of order n, ψ(G) is maximum if and only if G ≃ ℤn where ℤn denotes the cyclic group of order n. Furthermore, Herzog, Longobardi, and Maj in 2018 proved that if G is non-cyclic, ψ(G) ≤ (7)/(11) ψ(ℤn). Amiri and Amiri in 2014 introduced the function ψk(G) which is defined as the sum of the k-th powers of element orders of G and they showed that for every positive integer k, ψk(G) is also maximum if and only if G is cyclic. In this paper, we have been able to prove that if G is a non-cyclic group of order n, then ψk(G) ≤ (1+3.2k)/(1+2.4k+2k) ψk(ℤn). Setting k=1 in our result, we immediately get the result of Herzog et al. as a simple corollary. Besides, a recursive formula for ψk(G) is also obtained for finite abelian p-groups G, using which one can explicitly find out the exact value of ψk(G) for finite abelian groups G.