Buscar
Mostrando ítems 1-7 de 7
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
The cyclic sliding operation in Garside groups
(Springer, 2010-05)
We present a new operation to be performed on elements in a Garside group, called cyclic sliding, which is introduced to replace the well known cycling and decycling operations. Cyclic sliding appears to be a more natural ...
Artículo
Solving the conjugacy problem in Garside groups by cyclic sliding
(Elsevier, 2010-06)
We present a solution to the conjugacy decision problem and the conjugacy search problem in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. This is done by replacing the well ...
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 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 ...
Artículo
Generating random braids
(Elsevier, 2013-01)
We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of ...