The conjugacy problem for Out(F₃)
Free nonabelian groups (20E05) Automorphisms of infinite groups (20E36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Automorphism groups of groups (20F28) Geometric group theory (20F65) Hyperbolic groups and nonpositively curved groups (20F67)
This paper presents a solution to Dehn's conjugacy problem in \(\operatorname{Out}(F_3)\), the group of outer automorphisms of the free group \(F_3\) of rank 3. The main result, Theorem 1.1, states that there exists an algorithm that, given two automorphisms \(\phi, \psi \in \operatorname{Aut}(F_3)\), decides whether their outer classes are conjugate in \(\operatorname{Out}(F_3)\).\N\NThe approach relies on the classification of automorphisms according to computable invariants: irreducibility, growth rate and the structure of polynomially growing subgroups. The authors develop a decision algorithm based on train track techniques and mapping tori, distinguishing cases where an invariant free factor of rank \(2\) exists. The paper establishes that when the maximal polynomial growth subgroups are cyclic, conjugacy is decidable. This classification reduces the problem to previously solved cases and allows for a complete resolution of the conjugacy problem in \(\operatorname{Out}(F_3)\).\N\NThe authors also provide concrete examples illustrating the different cases. For instance, they show that automorphisms preserving an invariant rank \(2\) free factor can be classified using an induction step from \(\operatorname{Out}(F_2)\). Additionally, exponentially growing automorphisms are studied through the structure of their attracting laminations and mapping tori, leveraging results from hyperbolic geometry.
- A remark on thickness of free-by-cyclic groups
- Actions of finite groups of graphs and related automorphisms of free groups
- Actions of finitely generated groups on \(\mathbb{R}\)-trees.
- Algorithmic constructions of relative train track maps and CTs
- Algorithmic detectability of iwip automorphisms.
- An equivariant Whitehead algorithm and conjugacy for roots of Dehn twist automorphisms
- An index for counting fixed points of automorphisms of free groups
- Centralisers of Dehn twist automorphisms of free groups
- Classification of automorphisms of the free group of rank 2 by ranks of fixed-point subgroups
- Combinatorial group theory.
- Conjugacy and centralizers for iwip automorphisms of free groups.
- Counting growth types of automorphisms of free groups.
- Decomposition of a Group with a Single Defining Relation into a Free Product
- Decompositions of free groups
- Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm
- Detour Functions and Quasi-Isometries
- Displacements of automorphisms of free groups. II: Connectivity of level sets and decision problems
- Free-by-cyclic groups, automorphisms and actions on nearly canonical trees
- scientific article; zbMATH DE number 140325 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- Hyperbolic automorphisms of free groups
- Irreducibility of a free group endomorphism is a mapping torus invariant
- JSJ decompositions of groups
- Laminations, trees, and irreducible automorphisms of free groups
- Maximal index automorphisms of free groups with no attracting fixed points on the boundary are Dehn twists.
- On suspensions and conjugacy of hyperbolic automorphisms
- On suspensions, and conjugacy of a few more automorphisms of free groups
- On the conjugacy problem for automorphisms of free groups. With an addendum
- On the one-endedness of graphs of groups.
- Orbit decidability and the conjugacy problem for some extensions of groups.
- Presenting parabolic subgroups.
- Relative hyperbolicity of free-by-cyclic extensions
- THE CONJUGACY PROBLEM IS SOLVABLE IN FREE-BY-CYCLIC GROUPS
- The isomorphism problem for hyperbolic groups. I
- The rank of actions on ${R}$-trees
- The recognition theorem for \(\text{Out}(F_n)\).
- 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.
- Train tracks and automorphisms of free groups
This page was built for publication: The conjugacy problem for \(\operatorname{Out}(F_3)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025876)
