Repositorio de producción científica de la Universidad de Sevilla

Fast algorithmic Nielsen-Thurston classification of four-strand braids

Opened Access Fast algorithmic Nielsen-Thurston classification of four-strand braids

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Calvez, Matthieu
Wiest, Bert
Departamento: Universidad de Sevilla. Departamento de álgebra
Fecha: 2012-04
Publicado en: Journal of Knot Theory and Its Ramifications, 21 (5), 1250043-1-1250043-25.
Tipo de documento: Artículo
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 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.
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.
Tamaño: 379.4Kb
Formato: PDF

URI: http://hdl.handle.net/11441/47584

DOI: 10.1142/S0218216511009959

Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones