SearcharxivSearch

arXiv · 2303.11027

On conjygacy classes in groups

Abstract

Let $G$ be a group. Write $G^{*}=G\setminus \{1\}$. An element $x$ of $G^{*}$ will be called deficient if $ \langle x\rangle < C_G(x)$ and it will be called non-deficient if $\langle x\rangle = C_G(x).$ If $x\in G$ is deficient (non-deficient), then the conjugacy class $x^G$ of $x$ in $G$ will be also called deficient (non-deficient). Let $j$ be a non-negative integer. We shall say that the group $G$ has defect $j$, denoted by $G\in D(j)$ or by the phrase "$G$ is a $D(j)$-group", if exactly $j$ non-trivial conjugacy classes of $G$ are deficient. We first determine all finite $D(0)$-groups and $D(1)$-groups. Then we deal with arbitrary $D(0)$-groups and $D(1)$-groups: we find properties of arbitrary $D(0)$-groups and $D(1)$-groups, which force these groups to be finite.

Explore related subjects

Keep this discovery

BibTeXRIS

Marcel Herzog, Patrizia Longobardi, Mercede Maj. 2023-03-20. On conjygacy classes in groups. https://arxiv.org/abs/2303.11027

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