SearcharxivSearch

arXiv · 2007.00110

The dynamical approach to the conjugacy in groups

Abstract

Given a discrete group $G$, we identify the Stone-$\check C$ech compactification $\beta G$ with the set of all ultrafilters on $G$ and put $G^\ast =\beta G\setminus G$. The action $G$ on $G$ by the conjugations $(g,x)\mapsto g^{-1}xg$ induces the action of $G$ on $G^\ast$ by $(g, p)\mapsto p^g $, $p^g = \{ g^{-1} Pg: P\in p\}$. We study interplays between the algebraic properties of $G$ and the dynamical properties of $(G, G^\ast)$. In particular, we show that $p^G$ is finite for each $p\in G^\ast$ if and only if the commutant of $G$ is finite.

Explore related subjects

Keep this discovery

BibTeXRIS

Igor Protasov, Ksenia Protasova. 2020-06-30. The dynamical approach to the conjugacy in groups. https://arxiv.org/abs/2007.00110

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