A polynomial-time solution to the reducibility problem
classification
🧮 math.GT
math.GR
keywords
algorithmbraidinputpolynomial-timereduciblebraidscertaincircles
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.