Ends of Schreier graphs of hyperbolic groups

Vonseel, Audrey

doi:10.2140/agt.2018.18.3089

Download this article
	For screen
	For printing

Recent Issues

The Journal

About the Journal

Editorial Board

Subscriptions

Submission Guidelines

Submission Page

Policies for Authors

Ethics Statement

ISSN 1472-2739 (online)

ISSN 1472-2747 (print)

Author Index

To Appear

Other MSP Journals

Ends of Schreier graphs of hyperbolic groups

Audrey Vonseel

Algebraic & Geometric Topology 18 (2018) 3089–3118

DOI: 10.2140/agt.2018.18.3089

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 quasiconvex subgroup of $G$ , we construct an algorithm.

Keywords

relative ends, Schreier graphs, hyperbolic groups, Bestvina–Mess condition

Mathematical Subject Classification 2010

Primary: 20F65

Secondary: 20F10

References

Publication

Received: 14 February 2018

Revised: 11 June 2018

Accepted: 21 June 2018

Published: 22 August 2018

Authors

Audrey Vonseel
Institut de Recherche Mathématique Avancée Université de Strasbourg, CNRS, UMR 7501 Strasbourg France

Volume 18, issue 5 (2018)