SearcharxivSearch

arXiv · 2601.11253

Finite groups with a large normalized sum of element orders

Abstract

For a finite group $G$, let $\psi(G)$ be the sum of the orders of its elements, and define the corresponding normalized sum as $\psi'(G) := \psi(G)/\psi(\mathcal{C}_{|G|})$, where $\mathcal{C}_{|G|}$ is the cyclic group of the same order as $G$. Inspired by analogous criteria for the classes of soluble, supersoluble, and nilpotent groups, our main result establishes that if $\psi'(G)>\psi'(D_8) = \frac{19}{43}$, then $G$ belongs to the well-understood class of groups with a modular subgroup lattice, whose structure theory allows us to readily identify all groups satisfying this bound. Moreover, the equality case is fully settled. Finally, our arguments lead to a complete description of all groups satisfying $\psi'(G)> \psi'(A_4) = \frac{31}{77}$, thereby fully determining the groups covered by the supersolubility criterion of Baniasad Azad and Khosravi [Canad. Math. Bull. 65 (2022), 30--38], and thus providing a more complete answer to a corresponding conjecture of T\v{a}rn\v{a}uceanu.

Explore related subjects

Keep this discovery

BibTeXRIS

Luigi Iorio, Marco Trombetti. 2026-01-16. Finite groups with a large normalized sum of element orders. https://arxiv.org/abs/2601.11253

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