Abelian subgroups of Out (Fn)

We classify abelian subgroups of Out (F-n) up to finite index in an algorithmic and computationally friendly way. A process called disintegration is used to canonically decompose a single rotationless element phi into a composition of finitely many elements and then these elements are used to generate an abelian subgroup A(phi) that contains phi. The main theorem is that up to finite index every abelian subgroup is realized by this construction. As an application we give an explicit description, in terms of relative train track maps and up to finite index, of all maximal rank abelian subgroups of Out(F-n) and of IA(n).