AN EQUIVARIANT WHITEHEAD ALGORITHM AND CONJUGACY FOR ROOTS OF DEHN TWIST AUTOMORPHISMS
DOI10.1017/S0013091599000061zbMath0980.20030MaRDI QIDQ2716983
Martin Lustig, Sava Krstić, Karen Vogtmann
Publication date: 13 November 2001
Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)
outer automorphism groupsgraphs of groupsconjugacy problemautomorphisms of free groupsWhitehead algorithmDehn twist automorphisms
Geometric group theory (20F65) Topological methods in group theory (57M07) Automorphisms of infinite groups (20E36) Free nonabelian groups (20E05) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (4)
This page was built for publication: AN EQUIVARIANT WHITEHEAD ALGORITHM AND CONJUGACY FOR ROOTS OF DEHN TWIST AUTOMORPHISMS