On Whitehead’s algorithm
From MaRDI portal
Publication:3322287
DOI10.1090/S0273-0979-1984-15246-7zbMath0537.20015MaRDI QIDQ3322287
Publication date: 1984
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Generators, relations, and presentations of groups (20F05) Automorphisms of infinite groups (20E36) Automorphism groups of groups (20F28) Free nonabelian groups (20E05)
Related Items
ON RESTRICTING SUBSETS OF BASES IN RELATIVELY FREE GROUPS, Primitive and almost primitive elements of Schreier varieties, ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM, A McCool Whitehead type theorem for finitely generated subgroups of \(\operatorname{Out}(F_n)\), On an algorithm to decide whether a free group is a free factor of another, Primitive words, free factors and measure preservation., Topographs and groups, Automorphism group of a free group: Centralizers and stabilizers, Automorphisms of groups, AUTOMORPHIC ORBITS IN FREE GROUPS: WORDS VERSUS SUBGROUPS, The Grushko decomposition of a finite graph of finite rank free groups: an algorithm.
Cites Work
- Unnamed Item
- On free groups and their automorphisms
- Intersections of finitely generated subgroups of free groups and resolutions of graphs
- Some finitely presented subgroups of the automorphism group of a free group
- Fixed points of automorphisms of free groups
- On equivalent sets of elements in a free group
- A Presentation for the Automorphism Group of a Free Group of Finite Rank
- On fixed points of automorphisms of finitely generated free groups
- Equivalence of Elements Under Automorphisms of a Free Group
- On Certain Sets of Elements in a Free Group
