An algorithm to recognize echelon subgroups of a free group
From MaRDI portal
Publication:6573213
Recommendations
Cites work
- scientific article; zbMATH DE number 3116633 (Why is no real title available?)
- scientific article; zbMATH DE number 5343239 (Why is no real title available?)
- A description of auto-fixed subgroups in a free group.
- A fine property of Whitehead's algorithm
- A remark on Whitehead's cut-vertex lemma
- An algorithm for finding a basis of the fixed point subgroup of an automorphism of a free group.
- CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
- Computing fixed closures in free groups.
- Diskbusting elements of the free group
- Essential surfaces in graph pairs
- Fixed points of automorphisms of free groups
- ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
- On Certain Sets of Elements in a Free Group
- On Whitehead’s algorithm
- On an algorithm to decide whether a free group is a free factor of another
- On fixed subgroups of maximal rank
- On free-group algorithms that sandwich a subgroup between free-product factors.
- On the intersection of subgroups in free groups: Echelon subgroups are inert
- Stallings foldings and subgroups of free groups
- Submultiplicativity and the Hanna Neumann conjecture.
- The Group Fixed by a Family of Injective Endomorphisms of a Free Group
- The Hanna Neumann conjecture for surface groups
- The intersection of subgroups in free groups and linear programming
- Topology of finite graphs
- Train tracks and automorphisms of free groups
This page was built for publication: An algorithm to recognize echelon subgroups of a free group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573213)
