Abstract: Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its word problem, and generating sets of the parabolic subgroups. We also give an algorithm that finds parabolic subgroups in a given recursively enumerable class of groups.
Recommendations
Cites work
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 849253 (Why is no real title available?)
- scientific article; zbMATH DE number 848089 (Why is no real title available?)
- Combinatorial group theory.
- Dehn filling in relatively hyperbolic groups.
- Finding relative hyperbolic structures
- Quasiconvexity in relatively hyperbolic groups
- Relative hyperbolicity and relative quasiconvexity for countable groups.
- Relatively hyperbolic groups.
- Relatively hyperbolic groups: intrinsic geometry, algebraic properties, and algorithmic problems
Cited in
(9)- Detecting geometric splittings in finitely presented groups
- Recognizing a relatively hyperbolic group by its Dehn fillings
- Hyperbolically embedded subgroups and rotating families in groups acting on hyperbolic spaces
- Relatively hyperbolic groups with semistable peripheral subgroups
- Hyperbolic groups with almost finitely presented subgroups (with an appendix by Robert Kropholler and Federico Vigolo)
- Finding relative hyperbolic structures
- Time complexity of the conjugacy problem in relatively hyperbolic groups.
- On fully residually-\(\mathcal{R}\) groups
- Deciding isomorphy using Dehn fillings, the splitting case
This page was built for publication: Presenting parabolic subgroups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q371272)