Computing JSJ decompositions of hyperbolic groups

Benjamin Barrett

Research output: Contribution to journalArticle (Academic Journal)peer-review

2 Citations (Scopus)
278 Downloads (Pure)


We present an algorithm that computes Bowditch's canonical JSJ decomposition of a given one‐ended hyperbolic group over its virtually cyclic subgroups. The algorithm works by identifying topological features in the boundary of the group. As a corollary we also show how to compute the JSJ decomposition of such a group over its virtually cyclic subgroups with infinite centre. We also give a new algorithm that determines whether a given one‐ended hyperbolic group is virtually Fuchsian. Our approach uses only the geometry of large balls in the Cayley graph and avoids Makanin's algorithm.
Original languageEnglish
Pages (from-to)527-558
Number of pages32
JournalJournal of Topology
Issue number2
Early online date2 May 2018
Publication statusPublished - 1 Jun 2018


Dive into the research topics of 'Computing JSJ decompositions of hyperbolic groups'. Together they form a unique fingerprint.

Cite this