A polynomial-time solution to the reducibility problem

Publication date 25 October 2006

Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

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 page was built for publication: A polynomial-time solution to the reducibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6478101)