Algorithmic constructions of relative train track maps and CTs
From MaRDI portal
Publication:1785958
DOI10.4171/GGD/466zbMath1456.20044arXiv1411.6302OpenAlexW2964090514MaRDI QIDQ1785958
Michael Handel, Mark E. Feighn
Publication date: 21 September 2018
Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.6302
Geometric group theory (20F65) Automorphisms of infinite groups (20E36) Free nonabelian groups (20E05)
Related Items (13)
Variations on the post correspondence problem for free groups ⋮ Distortion for abelian subgroups of Out(Fn) ⋮ Fixed points and stable images of endomorphisms for the free group of rank two ⋮ Explicit bounds for fixed subgroups of endomorphisms of free products ⋮ Post's correspondence problem: from computer science to algebra ⋮ Train track maps on graphs of groups ⋮ On suspensions, and conjugacy of a few more automorphisms of free groups ⋮ Virtually abelian subgroups of \(\mathrm{IA}_n(\mathbb{Z}/3)\) are abelian ⋮ Graph towers, laminations and their invariant measures ⋮ A list of applications of Stallings automata ⋮ Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm ⋮ Fixed subgroups and computation of auto-fixed closures in free-abelian times free groups ⋮ Displacements of automorphisms of free groups II: Connectivity of level sets and decision problems
This page was built for publication: Algorithmic constructions of relative train track maps and CTs
