A Whitehead algorithm for toral relatively hyperbolic groups.
From MaRDI portal
Publication:4904510
Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Automorphisms of infinite groups (20E36) Hyperbolic groups and nonpositively curved groups (20F67) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Abstract: We prove that there is an algorithm to determine whether a tuple of elements in a toral relatively hyperbolic group G is in the automorphic orbit of the other tuple.
Recommendations
Cites work
- A Whitehead algorithm for surface groups
- Existential questions in (relatively) hyperbolic groups.
- Limit groups for relatively hyperbolic groups. I: The basic tools.
- ON ENDOMORPHISMS OF TORSION-FREE HYPERBOLIC GROUPS
- On equivalent sets of elements in a free group
- Rescuing the Whitehead method for free products. I: Peak reduction
- Rescuing the Whitehead method for free products. II: The algorithm
- The isomorphism problem for all hyperbolic groups.
- The isomorphism problem for toral relatively hyperbolic groups.
Cited in
(6)- A Whitehead algorithm for surface groups
- The isomorphism problem for all hyperbolic groups.
- An equivariant Whitehead algorithm and conjugacy for roots of Dehn twist automorphisms
- Whitehead groups of certain hyperbolic manifolds
- ON ENDOMORPHISMS OF TORSION-FREE HYPERBOLIC GROUPS
- Virtually geometric words and Whitehead's algorithm.
This page was built for publication: A Whitehead algorithm for toral relatively hyperbolic groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904510)