A Whitehad algorithm for toral relatively hyperbolic groups

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/18702

Title:	A Whitehad algorithm for toral relatively hyperbolic groups
Author:	Kharlampovich, Olga; Ventura Capell, Enric
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III; Universitat Politècnica de Catalunya. MD - Matemàtica Discreta
Abstract:	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.
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra::Teoria de grups -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
Rights:	Electronic version of an article published as International journal of algebra and computation, Vol. 22, Issue 8, 2012, DOI: 10.1142/S0218196712400048 © World Scientific Publishing Company http://www.worldscientific.com/worldscinet/ijac
Document type:	Article - Submitted version Article
Share: