The conjugacy problem for \(\operatorname{Out}(F_3)\) (Q7025876)

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.