On Whitehead’s algorithm

DOI10.1090/S0273-0979-1984-15246-7MaRDI QIDQ3322287zbMATH OpenFDO

Authors Steve M. Gersten

Publication date 1984

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0273-0979-1984-15246-7

zbMATH Keywords

automorphismsfinitely generated free groupfinitely generated subgroupsfinitely presented

Mathematics Subject Classification ID

Free nonabelian groups (20E05) Automorphisms of infinite groups (20E36) Generators, relations, and presentations of groups (20F05) Automorphism groups of groups (20F28)

Recommendations

• Rescuing the Whitehead method for free products. I: Peak reduction
• Rescuing the Whitehead method for free products. II: The algorithm
• scientific article; zbMATH DE number 125573
• A Whitehead algorithm for surface groups
• Clusters, Currents, and Whitehead's Algorithm

Cites work

• A Presentation for the Automorphism Group of a Free Group of Finite Rank
• Equivalence of Elements Under Automorphisms of a Free Group
• Fixed points of automorphisms of free groups
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• Intersections of finitely generated subgroups of free groups and resolutions of graphs
• On Certain Sets of Elements in a Free Group
• On equivalent sets of elements in a free group
• On fixed points of automorphisms of finitely generated free groups
• On free groups and their automorphisms
• Some finitely presented subgroups of the automorphism group of a free group

Cited in

(21)

• Topographs and groups
• Automorphism group of a free group: Centralizers and stabilizers
• Automorphisms of groups
• A Whitehead algorithm for surface groups
• The swap conjecture of Tennant and Turner
• Primitive and almost primitive elements of Schreier varieties
• On restricting subsets of bases in relatively free groups.
• On free-group algorithms that sandwich a subgroup between free-product factors.
• ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
• On an algorithm to decide whether a free group is a free factor of another
• Automorphic orbits in free groups: words versus subgroups.
• scientific article; zbMATH DE number 125573 (Why is no real title available?)
• Primitive words, free factors and measure preservation.
• A Whitehead algorithm for toral relatively hyperbolic groups.
• A McCool Whitehead type theorem for finitely generated subgroups of \(\operatorname{Out}(F_n)\)
• On Whitehead's cut vertex lemma
• A fine property of Whitehead's algorithm
• An algorithm to recognize echelon subgroups of a free group
• The conjugacy problem for UPG elements of \(\operatorname{Out}(F_n)\)
• Primitivity testing in free group algebras via duality
• The Grushko decomposition of a finite graph of finite rank free groups: an algorithm.

This page was built for publication: On Whitehead’s algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3322287)