paper

Mapping Class Factorization via Fatgraph Nielsen Reduction

arXiv:0904.4067

Abstract

The mapping class group of a genus surface with one boundary component is known to have a simple yet infinite presentation with generators given by elementary moves called Whitehead moves on so-called marked bordered fatgraphs. In this paper, we introduce an algorithm called "fatgraph Nielsen reduction" which, from the action of a mapping class of on the fundamental group of , determines a sequence of Whitehead moves representing beginning at any choice of marked bordered fatgraph. As a consequence, this leads to an algorithm which factors any mapping class given by its action on in terms of a certain generating set for .

16 pages, 4 figures

Mapping Class Factorization via Fatgraph Nielsen Reduction · wovepaper