SearcharxivSearch

arXiv · 1811.06430

Test sequences and formal solutions over hyperbolic groups

Abstract

In 2006 Z. Sela and independently O. Kharlampovich and A. Myasnikov gave a solution to the Tarski problems by showing that two non-abelian free groups have the same elementary theory. Subsequently Z. Sela generalized the techniques used in his proof of the Tarski conjecture to classify all finitely generated groups elementary equivalent to a given torsion-free hyperbolic group. One important step in his analysis of the elementary theory of free and torsion-free hyperbolic groups is the Generalized Merzlyakov's Theorem. In our work we show that given a hyperbolic group $Γ$ and $Γ$-limit group $L$, there exists a larger group $Comp(L)$, namely its completion, into which $L$ embeds, and a sequence of points $(λ_n)$ in the variety $Hom(Comp(L),Γ)$ from which one can recover the structure of the group $Comp(L)$. Using such a test sequence $(λ_n)$ we are finally able to prove a version of the Generalized Merzlyakov's Theorem over all hyperbolic groups (possibly with torsion).

Explore related subjects

Keep this discovery

BibTeXRIS

Simon Heil. 2018-11-15. Test sequences and formal solutions over hyperbolic groups. https://arxiv.org/abs/1811.06430

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