S. Gersten announced an algorithm that takes as input two finite sequences $vec K=(K_1,dots, K_N)$ and $vec K=(K_1,dots, K_N)$ of conjugacy classes of finitely generated subgroups of $F_n$ and outputs: (1) $mathsf{YES}$ or $mathsf{NO}$ depending on
whether or not there is an element $thetain mathsf{Out}(F_n)$ such that $theta(vec K)=vec K$ together with one such $theta$ if it exists and (2) a finite presentation for the subgroup of $mathsf{Out}(F_n)$ fixing $vec K$. S. Kalajdv{z}ievski published a verification of this algorithm. We present a different algorithm from the point of view of Culler-Vogtmanns Outer space. New results include that the subgroup of $mathsf{Out}(F_n)$ fixing $vec K$ is of type $mathsf{VF}$, an equivariant version of these results, an application, and a unified approach to such questions.
$Out(F_n):=Aut(F_n)/Inn(F_n)$ denotes the outer automorphism group of the rank $n$ free group $F_n$. An element $phi$ of $Out(F_n)$ is polynomially growing if the word lengths of conjugacy classes in $F_n$ grow at most polynomially under iteration by
$phi$. We restrict attention to the subset $UPG(F_n)$ of $Out(F_n)$ consisting of polynomially growing elements whose action on $H_1(F_n, Z)$ is unipotent. In particular, if $phi$ is polynomially growing and acts trivially on $H_1(F_n,Z_3)$ then $phi$ is in $UPG(F_n)$ and also every polynomially growing element of $Out(F_n)$ has a positive power that is in $UPG(F_n)$. In this paper we solve the conjugacy problem for $UPG(F_n)$. Specifically we construct an algorithm that takes as input $phi, psiin UPG(F_n)$ and outputs YES or NO depending on whether or not there is $thetain Out(F_n)$ such that $psi=thetaphitheta^{-1}$. Further, if YES then such a $theta$ is produced.
Every rotationless outer automorphism of a finite rank free group is represented by a particularly useful relative train track map called a CT. The main result of this paper is that the constructions of CTs can be made algorithmic. A key step in our
argument is proving that it is algorithmic to check if an inclusion of one invariant free factor system in another is reduced. Several applications are included, as well as algorithmic constructions for relative train track maps in the general case.
When two free factors A and B of a free group F_n are in general position we define the projection of B to the splitting complex (alternatively, the complex of free factors) of A. We show that the projections satisfy properties analogous to subsurfac
e projections introduced by Masur and Minsky. We use the subfactor projections to construct an action of Out(F_n) on a finite product of hyperbolic spaces where every automorphism with exponential growth acts with positive translation length. We also prove a version of the Bounded geodesic image theorem. In the appendix, we give a sketch of the proof of the Handel-Mosher hyperbolicity theorem for the splitting complex using (liberal) folding paths.
This is the first in a planned series of papers giving an alternate approach to Zlil Selas work on the Tarski problems. The present paper is an exposition of work of Kharlampovich-Myasnikov and Sela giving a parametrization of Hom(G,F) where G is a f
initely generated group and F is a non-abelian free group.
We develop the geometry of folding paths in Outer space and, as an application, prove that the complex of free factors of a free group of finite rank is hyperbolic.
For any finite collection $f_i$ of fully irreducible automorphisms of the free group $F_n$ we construct a connected $delta$-hyperbolic $Out(F_n)$-complex in which each $f_i$ has positive translation length.
The mapping torus of an endomorphism Phi of a group G is the HNN-extension G*_G with bonding maps the identity and Phi. We show that a mapping torus of an injective free group endomorphism has the property that its finitely generated subgroups are fi
nitely presented and, moreover, these subgroups are of finite type.
