SearcharxivSearch

arXiv · 1610.03669

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

Abstract

Denote the sum of element orders in a finite group $G$ by $\psi(G)$ and let $C_n$ denote the cyclic group of order $n$. Suppose that $G$ is a non-cyclic finite group of order $n$ and $q$ is the least prime divisor of $n$. We proved that $\psi(G)\leq\frac 7{11}\psi(C_n)$ and $\psi(G)<\frac 1{q-1}\psi(C_n)$. The first result is best possible, since for each $n=4k$, $k$ odd, there exists a group $G$ of order $n$ satisfying $\psi(G)=\frac 7{11}\psi(C_n)$ and the second result implies that if $G$ is of odd order, then $\psi(G)<\frac 12\psi(C_n)$. Our results improve the inequality $\psi(G)<\psi(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 $\psi(G)$-based sufficient conditions for the solvability of $G$.

Explore related subjects

Keep this discovery

BibTeXRIS

Marcel Herzog, Patrizia Longobardi, Mercede Maj. 2016-10-12. An exact upper bound for sums of element orders in non-cyclic finite groups. https://arxiv.org/abs/1610.03669

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