A polynomial-time solution to the reducibility problem
Geometric Topology
2007-05-23 v3 Group Theory
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.
Cite
@article{arxiv.math/0610746,
title = {A polynomial-time solution to the reducibility problem},
author = {Ki Hyoung Ko and Jang Won Lee},
journal= {arXiv preprint arXiv:math/0610746},
year = {2007}
}
Comments
13 pages, 7 figures