arXiv · math/0610746
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ki Hyoung Ko, Jang Won Lee. 2006-12-05. A polynomial-time solution to the reducibility problem. https://arxiv.org/abs/math/0610746
Cite the original work for its findings. Save a collection to share your selection of sources.