An algorithm to recognize echelon subgroups of a free group
From MaRDI portal
Publication:6573213
DOI10.1142/S021819672450019XzbMATH Open1543.20028MaRDI QIDQ6573213FDOQ6573213
Authors: Dario Ascari 
Publication date: 16 July 2024
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Recommendations
Free nonabelian groups (20E05) Geometric group theory (20F65) Subgroup theorems; subgroup growth (20E07)
Cites Work
- Topology of finite graphs
- Train tracks and automorphisms of free groups
- Stallings foldings and subgroups of free groups
- Title not available (Why is that?)
- CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
- Submultiplicativity and the Hanna Neumann conjecture.
- A description of auto-fixed subgroups in a free group.
- ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
- On Certain Sets of Elements in a Free Group
- The Group Fixed by a Family of Injective Endomorphisms of a Free Group
- On Whitehead’s algorithm
- On an algorithm to decide whether a free group is a free factor of another
- Title not available (Why is that?)
- Fixed points of automorphisms of free groups
- Diskbusting elements of the free group
- On fixed subgroups of maximal rank
- Computing fixed closures in free groups.
- Essential surfaces in graph pairs
- An algorithm for finding a basis of the fixed point subgroup of an automorphism of a free group.
- The intersection of subgroups in free groups and linear programming
- A remark on Whitehead's cut-vertex lemma
- The Hanna Neumann conjecture for surface groups
- On the intersection of subgroups in free groups: Echelon subgroups are inert
- On free-group algorithms that sandwich a subgroup between free-product factors.
- A fine property of Whitehead's algorithm
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)
