arXiv Analytics

Sign in

arXiv:math/0201243 [math.GT]AbstractReferencesReviewsResources

Computation of Centralizers in Braid groups and Garside Groups

Nuno Franco, Juan Gonzalez-Meneses

Published 2002-01-25, updated 2002-12-10Version 2

We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conugacy problem given by the authors in a previous paper, are two main steps for solving conjugacy systems, thus breaking recently discovered cryptosystems based in braid groups. We also present the result of our computations, where we notice that our algorithm yields surprisingly small generating sets for the centralizers.

Comments: The algorithm has been improved by using the Summit Class, instead of the conjugacy class of the element under study. The word "normalizer" has been replaced by "centralizer". 14 pages, 4 figures
Categories: math.GT, math.GR
Subjects: 20F36, 20F10
Related articles: Most relevant | Search more
arXiv:math/0112310 [math.GT] (Published 2001-12-30, updated 2002-08-28)
Conjugacy problem for braid groups and Garside groups
arXiv:math/0609616 [math.GT] (Published 2006-09-21, updated 2007-02-22)
Conjugacy in Garside Groups III: Periodic braids
arXiv:math/0305156 [math.GT] (Published 2003-05-11, updated 2003-09-12)
On the structure of the centralizer of a braid