An exact upper bound for the sum of powers of element orders in non-cyclic finite groups

Abstract

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 Zn where Zn denotes the cyclic group of order n. Furthermore, Herzog, Longobardi, and Maj in 2018 proved that if G is non-cyclic, (G) ≤ 711 (Zn). 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.2k1+2.4k+2k k(Zn). 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…