2011
DOI: 10.1007/s00039-011-0120-0
|View full text |Cite
|
Sign up to set email alerts
|

The Isomorphism Problem for All Hyperbolic Groups

Abstract: International audienceWe give a solution to Dehn’s isomorphism problem for the class of all hyperbolic groups, possibly with torsion. We also prove a relative version for groups with peripheral structures. As a corollary, we give a uniform solution to Whitehead’s problem asking whether two tuples of elements of a hyperbolic group G are in the same orbit under the action of Aut(G). We also get an algorithm computing a generating set of the group of automorphisms of a hyperbolic group preserving a peripheral str… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
113
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 66 publications
(113 citation statements)
references
References 62 publications
(83 reference statements)
0
113
0
Order By: Relevance
“…See [Car11] for a related result proved independently by M. Carette, and [Lev05a,DG11] for the one-ended case.…”
Section: Moreover One May Decide Algorithmically Whether Out(g) Is Fmentioning
confidence: 99%
“…See [Car11] for a related result proved independently by M. Carette, and [Lev05a,DG11] for the one-ended case.…”
Section: Moreover One May Decide Algorithmically Whether Out(g) Is Fmentioning
confidence: 99%
“…Among the three crucial problems for groups raised by Max Dehn in 1911, the isomorphism problem is the most difficult (the word and conjugacy problems constitute the other two: see [13] and [9]). The problem of deciding whether two words (using some algorithms) in some finite generating sets represent the same or conjugate elements in a group constitutes the same word are the word and conjugacy problems respectively.…”
Section: Properties Of the Inverse Graphsmentioning
confidence: 99%
“…Isomorphism problem, on the other hand, has to do with determining whether two groups that appear different are actually the same. In fact, Francois and Vincent asserted that the problem of finding an isomorphism of two groups is unsolvable for some classes of groups, [9]. This is quite interesting as a lot of researches are still going on to solve these problems.…”
Section: Properties Of the Inverse Graphsmentioning
confidence: 99%
“…When G is hyperbolic, RC-trees are the Z max -trees of [DG11]: non-trivial edge stabilizers are maximal cyclic subgroups. Proof.…”
Section: Definition 43 a Tree T Is An Rc-tree Ifmentioning
confidence: 99%
“…LetḠ e be the root-closure of G e in G v 1 (hence also in G). As in Section 4.3 of [DG11], we can fold all edges in theḠ e -orbit of e together. Doing this for all edges of T i yields an RC-tree U i which is Mc(H i )-invariant.…”
Section: The Chain Conditionmentioning
confidence: 99%