SearcharxivSearch

arXiv · 2208.05161

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

Abstract

For a finite group $G$, let $\psi(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$, $\psi(G)$ is maximum if and only if $G \simeq \mathbb{Z}_n$ where $\mathbb{Z}_n$ denotes the cyclic group of order $n$. Furthermore, Herzog, Longobardi, and Maj in 2018 proved that if $G$ is non-cyclic, $\psi(G) \leq \frac{7}{11} \psi(\mathbb{Z}_n)$. Amiri and Amiri in 2014 introduced the function $\psi_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$, $\psi_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 $\psi_k(G) \leq \frac{1+3.2^k}{1+2.4^k+2^k} \psi_k(\mathbb{Z}_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 $\psi_k(G)$ is also obtained for finite abelian $p$-groups $G$, using which one can explicitly find out the exact value of $\psi_k(G)$ for finite abelian groups $G$.

Explore related subjects

Keep this discovery

BibTeXRIS

Hiranya Kishore Dey, Archita Mondal. 2022-08-10. An exact upper bound for the sum of powers of element orders in non-cyclic finite groups. https://arxiv.org/abs/2208.05161

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR