Artículo
Fast algorithmic Nielsen-Thurston classification of four-strand braids
Autor/es | Calvez, Matthieu
Wiest, Bert |
Departamento | Universidad de Sevilla. Departamento de álgebra |
Fecha de publicación | 2012-04 |
Fecha de depósito | 2016-10-17 |
Publicado en |
|
Resumen | We give an algorithm which decides the Nielsen-Thurston type of a given four-strand braid. The complexity of our algorithm is quadratic with respect to word length. The proof of its validity is based on a result which ... We give an algorithm which decides the Nielsen-Thurston type of a given four-strand braid. The complexity of our algorithm is quadratic with respect to word length. The proof of its validity is based on a result which states that for a reducible 4-braid which is as short as possible within its conjugacy class (short in the sense of Garside), reducing curves surrounding three punctures must be round or almost round. As an application, we give a polynomial time solution to the conjugacy problem for non-pseudo-Anosov four-strand braids. |
Agencias financiadoras | Université Européenne de Bretagne |
Cita | Calvez, M. y Wiest, B. (2012). Fast algorithmic Nielsen-Thurston classification of four-strand braids. Journal of Knot Theory and Its Ramifications, 21 (5), 1250043-1-1250043-25. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Fast algorithmic Nielsen-Thurston ... | 379.4Kb | [PDF] | Ver/ | |