SearcharxivSearch

arXiv · 1108.5641

Algebraic & definable closure in free groups

Abstract

We study algebraic closure and its relation with definable closure in free groups and more generally in torsion-free hyperbolic groups. Given a torsion-free hyperbolic group G and a nonabelian subgroup A of G, we describe G as a constructible group from the algebraic closure of A along cyclic subgroups. In particular, it follows that the algebraic closure of A is finitely generated, quasiconvex and hyperbolic. Suppose that G is free. Then the definable closure of A is a free factor of the algebraic closure of A and the rank of these groups is bounded by that of G. We prove that the algebraic closure of A coincides with the vertex group containing A in the generalized cyclic JSJ-decomposition of G relative to A. If the rank of G is bigger than 4, then G has a subgroup A such that the definable closure of A is a proper subgroup of the algebraic closure of A. This answers a question of Sela.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Ould Houcine, D. Vallino. 2012-05-14. Algebraic & definable closure in free groups. https://arxiv.org/abs/1108.5641

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