Buscar
Mostrando ítems 1-4 de 4
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
Conjugacy in Garside groups II: Structure of the ultra summit set
(European Mathematical Society, 2008)
This paper is the second in a series in which the authors study the conjugacy decision problem (CDP) and the conjugacy search problem (CSP) in Garside groups. The ultra summit set USS(X) of an element X in a Garside group ...
Artículo
Conjugacy in Garside groups I: Cyclings, powers, and rigidity
(European Mathematical Society, 2007)
In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where ‘rigid’ means that ...
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 ...