The following pages link to On Whitehead’s algorithm (Q3322287):
Displaying 13 items.
- Primitive words, free factors and measure preservation. (Q466065) (← links)
- The Grushko decomposition of a finite graph of finite rank free groups: an algorithm. (Q813154) (← links)
- Topographs and groups (Q1196808) (← links)
- Automorphism group of a free group: Centralizers and stabilizers (Q1204546) (← links)
- Automorphisms of groups (Q1205159) (← links)
- The swap conjecture of Tennant and Turner (Q1918793) (← links)
- Primitive and almost primitive elements of Schreier varieties (Q2416810) (← links)
- ON RESTRICTING SUBSETS OF BASES IN RELATIVELY FREE GROUPS (Q3166261) (← links)
- ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM (Q3502844) (← links)
- On an algorithm to decide whether a free group is a free factor of another (Q3515469) (← links)
- AUTOMORPHIC ORBITS IN FREE GROUPS: WORDS VERSUS SUBGROUPS (Q3580224) (← links)
- A McCool Whitehead type theorem for finitely generated subgroups of \(\operatorname{Out}(F_n)\) (Q6098912) (← links)
- An algorithm to recognize echelon subgroups of a free group (Q6573213) (← links)
