AN EQUIVARIANT WHITEHEAD ALGORITHM AND CONJUGACY FOR ROOTS OF DEHN TWIST AUTOMORPHISMS

PROCEEDINGS OF THE EDINBURGH MATHEMATICAL SOCIETY, pp. 117-141, 2001.

Cited by: 9|Bibtex|Views1|Links
Keywords:
automorphisms of free groupsconjugacy problemDehn twistsWhitehead algorithm

Abstract:

Given finite sets of cyclic words {u(1), ..., u(k)} and {nu (1), ..., nu (k)} in a finitely generated free group F and two finite groups A and B of outer automorphisms of F, we produce an algorithm to decide whether there is an automorphism which conjugates A to B and takes u(i) to nu (i) for each i. If 4 and B are trivial, this is the cl...More

Code:

Data:

Your rating :
0

 

Tags
Comments