The isomorphism problem for toral relatively hyperbolic groups. (Q1044356)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The isomorphism problem for toral relatively hyperbolic groups.
scientific article

    Statements

    The isomorphism problem for toral relatively hyperbolic groups. (English)
    0 references
    0 references
    0 references
    11 December 2009
    0 references
    A relatively hyperbolic group is called `toral' if it is torsion-free and its parabolic subgroups are all finitely generated Abelian. The main result of the paper is the following: Theorem A. The isomorphism problem is solvable for the class of toral relatively hyperbolic groups. As a special case the authors recover the solvability of the isomorphism problem of torsion-free hyperbolic groups first proved by Sela and Bumagin, Kharlampovich and Miasnikov. The last three authors have shown the solvabiliity of the isomorphism problem for finitely generated fully residually free groups (limit groups) which follows from Theorem A also. Theorem A is shown by algorithmically constructing the JSJ decomposition of a freely indecomposable toral relatively hyperbolic group. This leads also to the following result: Theorem D. There is an algorithm which takes a finite presentation for a finitely indecomposable toral relatively hyperbolic group \(\Gamma\) as input and outputs a graph of groups which is a primary JSJ decomposition for \(\Gamma\). The authors use Mostow-Prasad rigidity to show: Theorem E. The homeomorphism problem is solvable for finite volume hyperbolic \(n\)-manifolds for \(n\geq 3\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    isomorphism problem
    0 references
    relatively hyperbolic groups
    0 references
    hyperbolic manifolds
    0 references
    finitely presented groups
    0 references
    parabolic subgroups
    0 references
    torsionfree hyperbolic groups
    0 references
    limit groups
    0 references
    algorithms
    0 references
    JSJ decompositions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references