Computing JSJ decompositions of hyperbolic groups

Abstract

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 or not 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…