A Whitehad algorithm for toral relatively hyperbolic groups
The Whitehead problem is solved in the class of toral relatively hyperbolic groups G (i.e. torsion-free relatively hyperbolic groups with abelian parabolic subgroups): there is an algorithm which, given two nite tuples (u1; ... ; un) and (v1; ... ; vn) of elements of G, decides whether there is an a...
| Authors: | ; |
|---|---|
| Format: | Article |
| Publication date: | 2012 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/18702 |
| Online Access: | https://hdl.handle.net/2117/18702 https://dx.doi.org/10.1142/S0218196712400048 |
| Access Level: | Open access |
| Keyword: | Toral relatively hyperbolic groups, Whitehead problem, automorphism Group theory Whitehead groups Grups, Teoria de Whitehead, Grups de Classificació AMS::20 Group theory and generalizations::20F Special aspects of infinite or finite groups Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra::Teoria de grups |
| Summary: | The Whitehead problem is solved in the class of toral relatively hyperbolic groups G (i.e. torsion-free relatively hyperbolic groups with abelian parabolic subgroups): there is an algorithm which, given two nite tuples (u1; ... ; un) and (v1; ... ; vn) of elements of G, decides whether there is an automorphism of G taking ui to vi for all i. |
|---|