SearcharxivSearch

arXiv · 2203.04048

Mixed commutator lengths, wreath products and general ranks

Abstract

In the present paper, for a pair $(G,N)$ of a group $G$ and its normal subgroup $N$, we consider the mixed commutator length $\mathrm{cl}_{G,N}$ on the mixed commutator subgroup $[G,N]$. We focus on the setting of wreath products: $ (G,N)=(\mathbb{Z}\wr \Gamma, \bigoplus_{\Gamma}\mathbb{Z})$. Then we determine mixed commutator lengths in terms of the general rank in the sense of Malcev. As a byproduct, when an abelian group $\Gamma$ is not locally cyclic, the ordinary commutator length $\mathrm{cl}_G$ does not coincide with $\mathrm{cl}_{G,N}$ on $[G,N]$ for the above pair. On the other hand, we prove that if $\Gamma$ is locally cyclic, then for every pair $(G,N)$ such that $1\to N\to G\to \Gamma \to 1$ is exact, $\mathrm{cl}_{G}$ and $\mathrm{cl}_{G,N}$ coincide on $[G,N]$. We also study the case of permutational wreath products when the group $\Gamma$ belongs to a certain class related to surface groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Morimichi Kawasaki, Mitsuaki Kimura, Shuhei Maruyama, Takahiro Matsushita, Masato Mimura. 2022-03-08. Mixed commutator lengths, wreath products and general ranks. https://arxiv.org/abs/2203.04048

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