An Implementation of the Bestvina-Handel Algorithm for Surface Homeomorphisms

1999/05/26 by Peter Brinkmann
Mathematics · Computer Science · #math.GR #cs.MS #math.GT

paper · pdf

published as Experimental Mathematics 9:2, 2000, 235-240 · 13 pages, 5 figures

arxiv created 1999/05/26 · arxiv updated 2009/11/30

Abstract

Bestvina and Handel have found an effective algorithm that determines whether a given homeomorphism of an orientable, possibly punctured surface is pseudo-Anosov. We present a software package in Java that realizes this algorithm for surfaces with one puncture. Moreover, the package allows the user to define homeomorphisms in terms of Dehn twists, and in the pseudo-Anosov case it generates images of train tracks in the sense of Bestvina-Handel.

Related

• Creating pseudo-Anosov Maps from Permutations and Matrices
• Computing Triangulations of Mapping Tori of Surface Homeomorphisms
• Uniformly polynomial-time classification of surface homeomorphisms
• Irreducible train tracks for pseudo-Anosov homeomorphisms
• An Algorithmic Classification of Generalized Pseudo-Anosov Homeomorphisms via Geometric Markov Partitions