Related papers: Immersed cycles and the JSJ decomposition
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…
The JSJ decomposition encodes the automorphisms and the virtually cyclic splittings of a hyperbolic group. For general finitely presented groups, the JSJ decomposition encodes only their splittings. In this sequence of papers we study the…
We develop an algorithm of polynomial time complexity to construct the Grushko decomposition of fundamental groups of graphs of free groups with cyclic edge groups. Our methods rely on analysing vertex links of certain CAT(0) square…
In this paper we describe an elimination process which is a deterministic rewriting procedure that on each elementary step transforms one system of equations over free groups into a finitely many new ones. Infinite branches of this process…
The JSJ decomposition encodes the automorphisms and the virtually cyclic splittings of a hyperbolic group. For general finitely presented groups, the JSJ decomposition encodes only their splittings. In this sequence of papers we study the…
A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We construct the JSJ decomposition of a vGBS group over abelian groups. We prove that…
Using the canonical JSJ splitting, we describe the outer automorphism group $\Out(G)$ of a one-ended word hyperbolic group $G$. In particular, we discuss to what extent $\Out(G)$ is virtually a direct product of mapping class groups and a…
Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of…
We provide a direct connection between the Z_{max} (or essential) JSJ decomposition and the Friedl--Tillmann polytope of a hyperbolic two-generator one-relator group with abelianisation of rank $2$. We deduce various structural and…
We introduce two new moves on graphs of groups with cyclic edge groups that preserve the fundamental group. These moves allow us to address the isomorphism problem without the use of expansions, therefore keeping the number of vertices and…
A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We describe the compatibility JSJ decomposition over abelian groups. We prove that in…
We study the quasi-isometric rigidity of a large family of finitely generated groups that split as graphs of groups with virtually free vertex groups and two-ended edge groups. Let $G$ be a group that is one-ended, hyperbolic relative to…
Let $\Gamma$ be a word hyperbolic group with a cyclic JSJ decomposition that has only rigid vertex groups, which are all fundamental groups of closed surface groups. We show that any group $H$ quasi-isometric to $\Gamma$ is abstractly…
In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…
We demonstrate the quasi-isometry invariance of two important geometric structures for relatively hyperbolic groups: the coned space and the cusped space. As applications, we produce a JSJ-decomposition for relatively hyperbolic groups…
Let G be a graph of hyperbolic groups with 2-ended edge groups. We show that G is hierarchically hyperbolic if and only if G has no distorted infinite cyclic subgroup. More precisely, we show that G is hierarchically hyperbolic if and only…
We classify all possible JSJ decompositions of doubles of free groups of rank two and we then compute the Makanin-Razborov diagram of a particular double of a free group and deduce that in general limit groups are not freely subgroup…
Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an Eulerian graph decomposes into a unique number of cycles if and only if it does not contain two…
We construct examples of free-by-cyclic hyperbolic groups which fiber in infinitely many ways over Z. The construction involves adding a specialized square 2-cell to a non-positively curved, squared 2-complex defined by labeled oriented…
We construct `structure invariants' of a one-ended, finitely presented group that describe the way in which the factors of its JSJ decomposition over two-ended subgroups fit together. For groups satisfying two technical conditions, these…