SearcharxivSearch

arXiv · math/0304209

Diophantine geometry over groups and the elementary theory of free and hyperbolic groups

Abstract

We study sets of solutions to equations over a free group, projections of such sets, and the structure of elementary sets defined over a free group. The structre theory we obtain enable us to answer some questions of A. Tarski's, and classify those finitely generated groups that are elementary equivalent to a free group. Connections with low dimensional topology, and a generalization to (Gromov) hyperbolic groups will also be discussed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zlil Sela. 2003-04-15. Diophantine geometry over groups and the elementary theory of free and hyperbolic groups. https://arxiv.org/abs/math/0304209

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