SearcharxivSearch

arXiv · 1702.01379

Quasiperiodic and mixed commutator factorizations in free products of groups

Abstract

It is well known that a nontrivial commutator in a free group is never a proper power. We prove a theorem that generalizes this fact and has several worthwhile corollaries. For example, an equation $[ x_1, y_1] \ldots [ x_k, y_k] = z^n$, where $n \ge 2k$, in a free product $\mathcal{F}$ of groups without nontrivial elements of order $\le n$ implies that $z$ is conjugate to an element of a free factor of $\mathcal{F}$. If a nontrivial commutator in a free group factors into a product of elements which are conjugate to each other then all these elements are distinct.

Explore related subjects

Keep this discovery

BibTeXRIS

S. V. Ivanov, Anton A. Klyachko. 2017-02-05. Quasiperiodic and mixed commutator factorizations in free products of groups. https://doi.org/10.1112/blms.12188

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