A polynomial-time solution to the reducibility problem
Ko, Ki Hyoung · Lee, Jang Won
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.