Fast Nielsen-Thurston classification of braids
We prove the existence of an algorithm that solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index.
| Author: | |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2014 |
| Country: | España |
| Institution: | Universidad de Sevilla (US) |
| Repository: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/47518 |
| Online Access: | http://hdl.handle.net/11441/47518 https://doi.org/10.2140/agt.2014.14.1745 |
| Access Level: | Open access |
| Keyword: | Braid groups Nielsen-Thurston classification |
| Summary: | We prove the existence of an algorithm that solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index. |
|---|