A polynomial-time solution to the reducibility problem

Simple item page
dc.creatorKo, Ki Hyoung
dc.creatorLee, Jang Won
dc.date2006-10-25
dc.date2006-12-05
dc.date.accessioned2026-07-07T07:29:24Z
dc.date.available2026-07-07T07:29:24Z
dc.descriptionWe 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.
dc.description13 pages, 7 figures
dc.identifierhttps://arxiv.org/abs/math/0610746
dc.identifierhttp://arxiv.org/abs/math/0610746
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/118097
dc.subjectGeometric Topology
dc.subjectGroup Theory
dc.subject20F36; 20F10
dc.titleA polynomial-time solution to the reducibility problem
dc.typetext

Files

Collections

arXiv