scientific article; zbMATH DE number 848044

zbMATH Open0855.20035MaRDI QIDQ4867096FDOQ4867096

Authors: Edward C. Turner 

Publication date: 27 January 1997

Title of this publication is not available (Why is that?)

Recommendations

• An algorithm for finding a basis of the fixed point subgroup of an automorphism of a free group.
• Train tracks and automorphisms of free groups
• Free group automorphisms with many fixed points at infinity
• Publication:5752742
• Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm

zbMATH Keywords

automorphismsfixed pointsfree groupsfundamental groupsbouquet of circlesinduced automorphismstrain track mapsfixed subgroup of maximal rankindivisible Nielsen paths

Mathematics Subject Classification ID

Free nonabelian groups (20E05) Automorphisms of infinite groups (20E36) Geometric group theory (20F65) Fundamental group, presentations, free differential calculus (57M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Fundamental groups and their automorphisms (group-theoretic aspects) (20F34)

Cited In (6)

• Classification of automorphisms of the free group of rank 2 by ranks of fixed-point subgroups
• Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm
• Algorithmic problems for free-Abelian times free groups.
• Algorithmic constructions of relative train track maps and CTs
• Ideal Whitehead graphs in \(\mathrm{Out}(F_r)\). II: The complete graph in each rank
• Long turns, INP's and indices for free group automorphisms

This page was built for publication:

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