SearcharxivSearch

arXiv · 1908.04460

Algorithms detecting stability and Morseness for finitely generated groups

Abstract

The notions of stable and Morse subgroups of finitely generated groups generalize the concept of a quasiconvex subgroup of a word-hyperbolic group. For a word-hyperbolic group $G$, Kapovich provided a partial algorithm which, on input a finite set $S$ of $G$, halts if $S$ generates a quasiconvex subgroup of $G$ and runs forever otherwise. In this paper, we give various detection and decidability algorithms for stability and Morseness of a finitely generated subgroup of mapping class groups, right-angled Artin groups, toral relatively hyperbolic groups, and finitely generated groups discriminated by a locally quasiconvex torsion-free hyperbolic group (for example, ordinary limit groups).

Explore related subjects

Keep this discovery

BibTeXRIS

Heejoung Kim. 2019-08-13. Algorithms detecting stability and Morseness for finitely generated groups. https://doi.org/10.1016/j.jalgebra.2020.03.002

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