Finite non-parabolic subgroups of relatively hyperbolic groups

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Geometric group theory (20F65) Hyperbolic groups and nonpositively curved groups (20F67)

Review text

The paper proves a general upper bound on the order of finite non-parabolic subgroups in relatively hyperbolic groups, using parameters derived from a finite relative presentation. Using the framework developed by \textit{D. V. Osin} [Relatively hyperbolic groups: intrinsic geometry, algebraic properties and algorithmic problems. Providence, RI: American Mathematical Society (AMS) (2006; Zbl 1093.20025)], this paper shows that every finite non-parabolic subgroup of a relatively hyperbolic group \(G\) has order at most \((K(4\delta+2)^2)!\). Here, \(K = (2|X \cup \Omega|)^{2MC+1}\), where \(C\) is a relative isoperimetric constant, \(\delta\) is the hyperbolicity constant of the Cayley graph \(\Gamma(G, X \sqcup \mathcal{H})\) and \(M\) is the maximal length of a relator in a fixed finite relative presentation of \(G\). The set \(X\) is the relative generating set and \(\Omega\) denotes the set of all \(H_\lambda\)-letters appearing in the defining relators \(R\).\N\NThe result extends known bounds for hyperbolic groups, where finite subgroups are conjugate into bounded balls and provides the first effective upper bound even when the non-parabolic subgroup is cyclic. Under suitable assumptions, in particular the decidability of the word problem in each peripheral subgroup, the bound is computable. As a corollary, the order problem for non-parabolic elements becomes uniformly decidable across all finitely generated relatively hyperbolic groups with algorithmic peripheral structure.

Cites work

This page was built for publication: Finite non-parabolic subgroups of relatively hyperbolic groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982208)