A polynomial-time solution to the reducibility problem
Ki Hyoung Ko, Jang Won Lee
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.
Create a lesson
Related papers
Mapping class groups have a unique Polish group structure
Tyrone Ghaswala, Sumun Iyer, Robert Alonzo Lyman et al.
Around the Andreadakis-Johnson filtration
Yusuke Kuno
Mapping class groups of simply connected closed spin 5-manifolds with no 2- and 3-torsion in homology
Huize Jin
A note on surfaces with large systoles
Yifei Cai
Real ideal points, Conway spheres, and left-orderable Dehn fillings
Yi Wang
All once-extended 3D TQFTs are Reshetikhin--Turaev theories
Glen Lim