SearcharxivSearch

arXiv · 2608.08845

Detecting solvability, supersolvability and CLT properties via an invariant based on conjugacy classes of subgroups

Abstract

For a finite group $G$, denote by $k'(G)$ and $L(G)$ the number of conjugacy classes of subgroups and the subgroup lattice of $G$, respectively. Let $d'(G)=\frac{k'(G)}{|L(G)|}$ and $d^*(G)$ be the minimum value of $d'(S)$, when $S$ runs through all sections of $G$. In this paper we deduce some criteria on the nature of $G$. We show that if $d^*(G)>\frac{9}{59}$, then $G$ is solvable, while if $d^*(G)>\frac{1}{2}$, then $G$ is a supersolvable group. The last criterion is also valid when replacing ``supersolvable" with ``CLT".

Explore related subjects

Keep this discovery

BibTeXRIS

Mihai-Silviu Lazorec. 2026-08-09. Detecting solvability, supersolvability and CLT properties via an invariant based on conjugacy classes of subgroups. https://arxiv.org/abs/2608.08845

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