2 00 6 a Polynomial - Time Solution to the Reducibility Problem

Abstract

We propose an algorithm for deciding whether a given braid is pseudo-Anosov, reducible, or periodic. The algorithm is based on Garside's weighted decomposition and is polynomial-time in the word-length of an input braid. Moreover, a reduction system of circles can be found completely if the input is a certain type of reducible braids. 1. Preliminaries and… (More)

Topics

7 Figures and Tables

Cite this paper

@inproceedings{Ko2006206, title={2 00 6 a Polynomial - Time Solution to the Reducibility Problem}, author={Ki Hyoung Ko and Jang Won Lee}, year={2006} }