Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm
From MaRDI portal
Publication:5743082
DOI10.1080/10586458.2017.1326326zbMath1470.20019arXiv1609.03820OpenAlexW2619912549MaRDI QIDQ5743082
Publication date: 8 May 2019
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.03820
Related Items (6)
Counting conjugacy classes of fully irreducibles: double exponential growth ⋮ Irreducible nonsurjective endomorphisms of Fn are hyperbolic ⋮ COUNTING CONJUGACY CLASSES IN ⋮ The minimally displaced set of an irreducible automorphism is locally finite ⋮ Displacements of automorphisms of free groups I: Displacement functions, minpoints and train tracks ⋮ Displacements of automorphisms of free groups II: Connectivity of level sets and decision problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Botany of irreducible automorphisms of free groups.
- Mapping tori of small dilatation expanding train-track maps
- An algorithm to detect full irreducibility by bounding the volume of periodic free factors.
- Twisting out fully irreducible automorphisms.
- A combination theorem for negatively curved groups
- Dynamics on free-by-cyclic groups
- Topology of finite graphs
- Automorphisms of free groups have finitely generated fixed point sets
- Train tracks and automorphisms of free groups
- Train-tracks for surface homeomorphisms
- Laminations, trees, and irreducible automorphisms of free groups
- The Tits alternative for \(\text{Out}(F_n)\). I: Dynamics of exponentially-growing automorphisms
- Stallings foldings and subgroups of free groups
- Random walks on weakly hyperbolic groups
- McMullen polynomials and Lipschitz flows for free-by-cyclic groups
- Endomorphisms, train track maps, and fully irreducible monodromies
- Algorithmic constructions of relative train track maps and CTs
- Automorphisms of free groups and outer space
- An index for counting fixed points of automorphisms of free groups
- Ideal Whitehead graphs in \(\mathrm{Out}(F_r)\). II: The complete graph in each rank
- The Tits alternative for \(\text{Out}(F_n)\). II: A Kolchin type theorem.
- Hyperbolicity of the complex of free factors.
- Introduction to group theory. Translated from the Russian. With a new chapter.
- A short proof of Handel and Mosher's alternative for subgroups of \(\mathrm{Out}(F_N)\).
- Dynamics of Out(Fn) on the boundary of outer space
- A train track directed random walk on Out(Fr)
- Axes in outer space
- On free-group algorithms that sandwich a subgroup between free-product factors
- The quadratic isoperimetric inequality for mapping tori of free group automorphisms
- ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
- PING-PONG AND OUTER SPACE
- Subgroups of free groups and primitive elements
- IRREDUCIBLE AUTOMORPHISMS OF $F_{n}$ HAVE NORTH–SOUTH DYNAMICS ON COMPACTIFIED OUTER SPACE
- The Group Fixed by a Family of Injective Endomorphisms of a Free Group
- Dynamics of hyperbolic iwips
- The co‐surface graph and the geometry of hyperbolic free group extensions
- Free group automorphisms with many fixed points at infinity
- Algorithmic detectability of iwip automorphisms
- Form-invariant Poisson brackets of hydrodynamic type with several spatial variables
This page was built for publication: Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm
