SearcharxivSearch

arXiv · 1901.09662

The second maximal groups with respect to the sum of element orders

Abstract

Denote by $G$ a finite group and let $\psi(G)$ denote the sum of element orders in $G$. In 2009, H.Amiri, S.M.Jafarian Amiri and I.M.Isaacs proved that if $|G|=n$ and $G$ is non-cyclic, then $\psi(G)<\psi(C_n)$, where $C_n$ denotes the cyclic group of order $n$. In 2018 we proved that if $G$ is non-cyclic group of order $n$, then $\psi(G)\leq \frac 7{11}\psi(C_n)$ and equality holds if $n=4k$ with $(k,2)=1$ and $G=(C_2\times C_2)\times C_k$. In this paper we proved that equality holds if and only if $n$ and $G$ are as indicated above. Moreover we proved the following generalization of this result: Theorem 4. Let $q$ be a prime and let $G$ be a non-cyclic group of order $n$, with $q$ being the least prime divisor of $n$. Then $\psi(G)\leq \frac {((q^2-1)q+1)(q+1)}{q^5+1}\psi(C_n)$, with equality if and only if $n=q^2k$ with $(k,q)=1$ and $G=(C_q\times C_q)\times C_k$. Notice that if $q=2$, then $\frac {((q^2-1)q+1)(q+1)}{q^5+1}=\frac 7{11}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Marcel Herzog, Patrizia Longobardi, Mercede Maj. 2019-01-28. The second maximal groups with respect to the sum of element orders. https://arxiv.org/abs/1901.09662

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