Buscar
Mostrando ítems 1-6 de 6
Artículo
On the cycling operation in braid groups
(Elsevier, 2008-09-06)
The cycling operation is a special kind of conjugation that can be applied to elements in Artin’s braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in ...
Artículo
On the minimal positive standardizer of a parabolic subgroup of an Artin–Tits group
(Springer, 2018-09-22)
The minimal standardizer of a curve system on a punctured disk is the minimal positive braid that transforms it into a system formed only by round curves. We give an algorithm to compute it in a geometrical way. Then, we ...
Artículo
Fast Nielsen-Thurston classification of braids
(Mathematical Sciences Publishers, 2014)
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.
Artículo
The root extraction problem for generic braids
(MDPI, 2019-10)
We show that, generically, finding the k-th root of a braid is very fast. More precisely, we provide an algorithm which, given a braid x on n strands and canonical length l, and an integer k > 1, computes a k-th root of ...
Artículo
Conjugacy problem for braid groups and Garside groups
(Elsevier, 2003-08-01)
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside ...
Artículo
Conjugacy in Garside Groups III: Periodic braids
(Elsevier, 2007-10-15)
An element in Artin’s braid group Bn is said to be periodic if some power of it lies in the center of Bn. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in Bn are ...