SearcharxivSearch

arXiv · 1805.08071

Equations in acylindrically hyperbolic groups and verbal closedness

Abstract

We describe solutions of the equation $x^ny^m=a^nb^m$ in acylindrically hyperbolic groups (AH-groups), where $a,b$ are non-commensurable special loxodromic elements and $n,m$ are integers with sufficiently large common divisor. Using this description and certain test words in AH-groups, we study the verbal closedness of AH-subgroups in groups. A subgroup $H$ of a group $G$ is called verbally closed if for any word $w(x_1,\dots, x_n)$ in variables $x_1,\dots,x_n$ and any element $h\in H$, the equation $w(x_1,\dots, x_n)=h$ has a solution in $G$ if and only if it has a solution in $H$. Main Theorem: Suppose that $G$ is a finitely presented group and $H$ is a finitely generated acylindrically hyperbolic subgroup of $G$ such that $H$ does not have nontrivial finite normal subgroups. Then $H$ is verbally closed in $G$ if and only if $H$ is a retract of $G$. The condition that $G$ is finitely presented and $H$ is finitely generated can be replaced by the condition that $G$ is finitely generated over $H$ and $H$ is equationally Noetherian. As a corollary, we solve Problem 5.2 from the paper arXiv:1201.0497v2 of Miasnikov and Roman'kov: Verbally closed subgroups of torsion-free hyperbolic groups are retracts.

Explore related subjects

Keep this discovery

BibTeXRIS

Oleg Bogopolski. 2018-05-18. Equations in acylindrically hyperbolic groups and verbal closedness. https://arxiv.org/abs/1805.08071

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