SearcharxivSearch

arXiv · 2501.11724

Proportion of Nilpotent Subgroups in Finite Groups and Their Properties

Abstract

This work introduces and investigates the function $J(G) = \frac{\text{Nil}(G)}{L(G)}$, where $\text{Nil}(G)$ denotes the number of nilpotent subgroups and $L(G)$ the total number of subgroups of a finite group $G$. The function $J(G)$, defined over the interval $(0,1]$, serves as a tool to analyze structural patterns in finite groups, particularly within non-nilpotent families such as supersolvable and dihedral groups. Analytical results demonstrate the product density of $J(G)$ values in $(0,1]$, highlighting its distribution across products of dihedral groups. Additionally, a probabilistic analysis was conducted, and based on extensive computational simulations, it was conjectured that the sample mean of $J(G)$ values converges in distribution to the standard normal distribution, in accordance with the Central Limit Theorem, as the sample size increases. These findings expand the understanding of multiplicative functions in group theory, offering novel insights into the structural and probabilistic behavior of finite groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

João Victor M. de Andrade, Leonardo Santos da Cruz. 2025-01-20. Proportion of Nilpotent Subgroups in Finite Groups and Their Properties. https://arxiv.org/abs/2501.11724

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