Immersed cycles and the JSJ decomposition

Abstract

We present an algorithm to construct the JSJ decomposition of one-ended hyperbolic groups which are fundamental groups of graphs of free groups with cyclic edge groups. Our algorithm runs in double exponential time, and is the first algorithm on JSJ decompositions to have an explicit time bound. Our methods are combinatorial/geometric and rely on analysing properties of immersed cycles in certain CAT(0) square complexes.

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…