A polynomial-time solution to the reducibility problem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
13 pages, 7 figures

Keywords

Geometric Topology, Group Theory, 20F36; 20F10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/118097

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0610746
 http://arxiv.org/abs/math/0610746

Collections

arXiv