A Whitehead algorithm for toral relatively hyperbolic groups.
DOI10.1142/S0218196712400048zbMATH Open1259.20053arXiv1204.4692MaRDI QIDQ4904510FDOQ4904510
Authors: Olga Kharlampovich, Enric Ventura Capell
Publication date: 30 January 2013
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.4692
Recommendations
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)
Cites Work
- The isomorphism problem for all hyperbolic groups.
- On equivalent sets of elements in a free group
- ON ENDOMORPHISMS OF TORSION-FREE HYPERBOLIC GROUPS
- The isomorphism problem for toral relatively hyperbolic groups.
- A Whitehead algorithm for surface groups
- Limit groups for relatively hyperbolic groups. I: The basic tools.
- Rescuing the Whitehead method for free products. I: Peak reduction
- Rescuing the Whitehead method for free products. II: The algorithm
- Existential questions in (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)