Abelian subgroups of (Fn)
Abstract
We classify abelian subgroups of Out(Fn) up to finite index in an algorithmic and computationally friendly way. A process called disintegration is used to canonically decompose a single rotationless element φ into a composition of finitely many elements and then use these elements to generate an abelian subgroup A(φ) that contains φ. The main theorem is that up to finite index every abelian subgroup is realized by this construction. As an application we classify, up to finite index, abelian subgroups of Out(Fn) and of IA with maximal rank.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.