Solvability of the conjugacy problem for finite subgroups in automorphism groups of free groups

Abstract

We prove that there exists an algorithm which solves a conjugacy problem for finite subgroups in automorphism and outer automorphism groups of a free group of finite rank. Of independent interest is the construction of an algorithm of decomposing an arbitrary free-by-finite group into a fundamental group of a finite graph of finite groups, with the number of steps evaluated explicitly. In passing, we solve the conjugacy problem for finite subgroups in almost free groups. As a consequence, an algorithm is obtained computing generating sets for a group of fixed points in an arbitrary finite automorphism group of a free group of finite rank.