An Equivariant Whitehead Algorithm and Conjugacy for Roots of Dehn Twist Automorphisms

Abstract

Given finite sets of cyclic words {u1, ..., uk} and {v1, ..., vk} 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 ui to vi for each i. If A and B are trivial, this is the classic algorithm due to J.H.C… (More)

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Krstic2000AnEW, title={An Equivariant Whitehead Algorithm and Conjugacy for Roots of Dehn Twist Automorphisms}, author={Sava Krstic and Martin Lustig and KAREN VOGTMANN}, year={2000} }