Computation of centralizers in braid groups and Garside groups.

DOI10.4171/RMI/352zbMath1064.20040arXivmath/0201243MaRDI QIDQ1884037

Juan González-Meneses, Nuno Franco

Publication date: 25 October 2004

Published in: Revista Matemática Iberoamericana (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0201243

zbMATH Keywords

conjugacy classes; braid groups; normal forms; Artin groups; generating sets; centralizers; conjugacy problem; Garside groups

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

20F05: Generators, relations, and presentations of groups

94A60: Cryptography

20F36: Braid groups; Artin groups

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

Related Items

On the structure of the centralizer of a braid, The \(n\)th root of a braid is unique up to conjugacy., Conjugacy search in braid groups. From a braid-based cryptogrphy point of view, Braids, their Properties and Generalizations

Cites Work

• Unnamed Item
• A new approach to the word and conjugacy problems in the braid groups
• An algebraic method for public-key cryptography
• Artin-Gruppen und Coxeter-Gruppen
• Theory of braids
• Groupes de Garside
• ALGORITHMS FOR POSITIVE BRAIDS
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• On the structure of the centralizer of a braid
• THE BRAID GROUP AND OTHER GROUPS
• The infimum, supremum, and geodesic length of a braid conjugacy class.