Immersed cycles and the JSJ decomposition
arXiv:1811.04677 · doi:10.2140/agt.2020.20.1877
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.
arXiv comment35 pages, 9 figures. v2: Incorporated referee comments. Results have been strengthened. To appear in Algebraic and Geometric Topology
References in corpus (9)
- Cubulating spaces with walls
- Simplicite de groupes d'automorphismes d'espaces a courbure negative
- The isomorphism problem for all hyperbolic groups
- Line Patterns in Free Groups
- One-ended subgroups of graphs of free groups with cyclic edge groups
- Deciding Isomorphy using Dehn fillings, the splitting case
- Splitting Line Patterns in Free Groups
- Virtual Geometricity is Rare
- Computing JSJ decompositions of hyperbolic groups