Abstract
We study the number of ends of a Schreier graph of a hyperbolic group. Let G be a hyperbolic group and let H be a subgroup of G. In general, there is no algorithm to compute the number of ends of a Schreier graph of the pair (G, H). However, assuming that H is a quasi-convex subgroup of G, we construct an algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have