Mapping Class Factorization via Fatgraph Nielsen Reduction

Abstract

The mapping class group of a genus g surface g,1 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 ∈ MCg,1 of g,1 on the fundamental group π1(g,1) of g,1, 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 π(g,1) in terms of a certain generating set for MCg,1.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…