SearcharxivSearch

arXiv · 2402.06708

Landau's Theorem on conjugacy classes for normal subgroups

Abstract

Landau's theorem on conjugacy classes asserts that there are only finitely many finite groups, up to isomorphism, with exactly $k$ conjugacy classes for any positive integer $k$. We show that, for any positive integers $n$ and $s$, there exists only a finite number of finite groups $G$, up to isomorphism, having a normal subgroup $N$ of index $n$ which contains exactly $s$ non-central $G$-conjugacy classes. We provide upper bounds for the orders of $G$ and $N$, which are used by using GAP to classify all finite groups with normal subgroups having a small index and few $G$-classes. We also study the corresponding problems when we only take into account the set of $G$-classes of prime-power order elements contained in a normal subgroup.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antonio Beltrán, María José Felipe, Carmen Melchor. 2024-02-09. Landau's Theorem on conjugacy classes for normal subgroups. https://arxiv.org/abs/2402.06708

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