Algorithmic detectability of iwip automorphisms.
From MaRDI portal
Abstract: We produce an algorithm that, given , where , decides wether or not is an iwip ("fully irreducible") automorphism.
Recommendations
- Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm
- An algorithm to detect full irreducibility by bounding the volume of periodic free factors.
- Detecting automorphic orbits in free groups.
- Conjugacy and centralizers for iwip automorphisms of free groups.
- Botany of irreducible automorphisms of free groups.
Cites work
- A combination theorem for negatively curved groups
- An Implementation of the Bestvina–Handel Algorithm for Surface Homeomorphisms
- An index for counting fixed points of automorphisms of free groups
- Automorphisms of free groups and outer space
- Botany of irreducible automorphisms of free groups.
- Dynamics of \(\text{Out}(F_n)\) on the boundary of outer space.
- Hyperbolic automorphisms of free groups
- Ideal Whitehead graphs in \(\mathrm{Out}(F_r)\). II: The complete graph in each rank
- Introduction to group theory. Translated from the Russian. With a new chapter.
- IRREDUCIBLE AUTOMORPHISMS OF $F_{n}$ HAVE NORTH–SOUTH DYNAMICS ON COMPACTIFIED OUTER SPACE
- Laminations, trees, and irreducible automorphisms of free groups
- Ping-pong and outer space.
- Stallings foldings and subgroups of free groups
- The Group Fixed by a Family of Injective Endomorphisms of a Free Group
- The quadratic isoperimetric inequality for mapping tori of free group automorphisms.
- The Tits alternative for \(\text{Out}(F_n)\). I: Dynamics of exponentially-growing automorphisms
- The Tits alternative for \(\text{Out}(F_n)\). II: A Kolchin type theorem.
- Topology of finite graphs
- Train tracks and automorphisms of free groups
- Train-tracks for surface homeomorphisms
- Twisting out fully irreducible automorphisms.
Cited in
(22)- The minimally displaced set of an irreducible automorphism of \(F_N\) is co-compact
- Ideal Whitehead graphs in \(\mathrm{Out}(F_r)\). II: The complete graph in each rank
- Conical limit points and the Cannon-Thurston map
- A train track directed random walk on \(\mathrm{Out}(F_r)\).
- Conjugacy and centralizers for iwip automorphisms of free groups.
- Ping-pong and outer space.
- Counting conjugacy classes in \(\mathrm{Out}(F_{N})\)
- An algorithm to detect full irreducibility by bounding the volume of periodic free factors.
- The minimally displaced set of an irreducible automorphism is locally finite
- Irreducible nonsurjective endomorphisms of Fn are hyperbolic
- Cannon-Thurston fibers for iwip automorphisms of FN
- Dynamics of hyperbolic iwips
- Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm
- Stable strata of geodesics in outer space
- 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
- Counting conjugacy classes of fully irreducibles: double exponential growth
- A Pansiot-type subword complexity theorem for automorphisms of free groups
- The conjugacy problem for \(\operatorname{Out}(F_3)\)
- Low complexity among principal fully irreducible elements of \(\mathrm{Out}(F3)\)
- Title not available (Why is no real title available?)
- Dynamics on free-by-cyclic groups
This page was built for publication: Algorithmic detectability of iwip automorphisms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5409111)
