The isomorphism problem for all hyperbolic groups. (Q540014)

From MaRDI portal
Revision as of 03:27, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The isomorphism problem for all hyperbolic groups.
scientific article

    Statements

    The isomorphism problem for all hyperbolic groups. (English)
    0 references
    0 references
    0 references
    1 June 2011
    0 references
    The authors present a solution to the isomorphism problem for hyperbolic groups. The first author with D. Groves had previously published a solution of this problem for hyperbolic groups without torsion. The authors also prove a relative version for groups with peripheral structure. As a corollary, they obtain a uniform solution to Whitehead's problem which in the present setting asks whether two tuples of elements in a hyperbolic group \(G\) are in the same orbit under the action of \(\Aut(G)\). The authors also obtain an algorithm computing a generating set of the group of automorphisms of a hyperbolic group preserving a peripheral structure. The strategy of the proof follows ideas of Sela, and the main ingredients are (1) the Stallings-Dunwoody deformation space of maximal decompositions of a hyperbolic group over finite groups; (2) A rigidity criterion stating that the outer automorphism group of a one-ended hyperbolic group is infinite if and only if the group has an ``interesting'' splitting that provides an infinite group of Dehn twists; (3) a kind of JSJ decomposition adapted to the rigidity criterion.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    isomorphism problem
    0 references
    hyperbolic groups
    0 references
    algorithms
    0 references
    combinatorial group theory
    0 references
    peripheral structures
    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
    0 references
    0 references