Abstract
We present an algorithm which decides whether a given quasiconvex residually finite subgroup H of a hyperbolic group G is associated with a splitting. The methods developed also provide algorithms for computing the number of filtered ends \tilde{e}(G,H) of H in G under certain hypotheses and give a new straightforward algorithm for computing the number of ends e(G,H) of the Schreier graph of H . Our techniques extend those of Barrett via the use of labelled digraphs, the languages of which encode information on the connectivity of \partial G - \Lambda H .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
