SearcharxivSearch

arXiv · math/0503030

On finite groups whose every proper normal subgroup is a union of a given number of conjugacy classes

Abstract

Let $G$ be a finite group and $A$ be a normal subgroup of $G$. We denote by $ncc(A)$ the number of $G$-conjugacy classes of $A$ and $A$ is called $n$-decomposable, if $ncc(A)=n$. Set ${\cal K}_G = \{ncc(A)| A \lhd G \}$. Let $X$ be a non-empty subset of positive integers. A group $G$ is called $X$-decomposable, if ${\cal K}_G = X$. Ashrafi and his co-authors \cite{ash1,ash2,ash3,ash4,ash5} have characterized the $X$-decomposable non-perfect finite groups for $X = \{1, n \}$ and $n \leq 10$. In this paper, we continue this problem and investigate the structure of $X$-decomposable non-perfect finite groups, for $X = \{1, 2, 3 \}$. We prove that such a group is isomorphic to $Z_6, D_8, Q_8, S_4$, SmallGroup(20, 3), SmallGroup(24, 3), where SmallGroup$(m,n)$ denotes the $m$th group of order $n$ in the small group library of GAP \cite{gap}.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ali Reza Ashrafi, Geetha Venkataraman. 2005-03-02. On finite groups whose every proper normal subgroup is a union of a given number of conjugacy classes. https://arxiv.org/abs/math/0503030

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