SearcharxivSearch

arXiv · 1307.6783

Effective coherence of groups discriminated by a locally quasi-convex hyperbolic group

Abstract

We prove that every finitely generated group $G$ discriminated by a locally quasi-convex torsion-free hyperbolic group $Γ$ is effectively coherent: that is, presentations for finitely generated subgroups can be computed from the subgroup generators. We study $G$ via its embedding into an iterated centralizer extension of $Γ$, and prove that this embedding can be computed. We also give algorithms to enumerate all finitely generated groups discriminated by $Γ$ and to decide whether a given group, with decidable word problem, is discriminated by $Γ$. If $Γ$ may have torsion, we prove that groups obtained from $Γ$ by iterated amalgamated products with virtually abelian groups, over elementary subgroups, are effectively coherent.

Explore related subjects

Keep this discovery

BibTeXRIS

Inna Bumagin, Jeremy Macdonald. 2014-12-11. Effective coherence of groups discriminated by a locally quasi-convex hyperbolic group. https://arxiv.org/abs/1307.6783

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