SearcharxivSearch

arXiv · 2606.17488

Proportion of Simple Subgroups in Finite Groups and Their Applications

Abstract

This work introduces and investigates the function \( \mathcal{V}(G) = \frac{\text{Simp}(G)}{|L(G)|} \), where \( \text{Simp}(G) \) denotes the number of simple subgroups and \( |L(G)| \) the total number of subgroups of a finite group \( G \). The function \( \mathcal{V}(G) \), defined on the interval \( [0,1] \), represents the proportion of simple subgroups relative to the total number of subgroups. It serves as a tool for analyzing structural patterns in finite groups, particularly in p-groups and other families.

Explore related subjects

Keep this discovery

BibTeXRIS

João Victor Monteiros de Andrade, Leonardo Santos da Cruz. 2026-06-16. Proportion of Simple Subgroups in Finite Groups and Their Applications. https://arxiv.org/abs/2606.17488

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