Computation of centralizers in braid groups and Garside groups.

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

Nuno Franco, Juan González-Meneses

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 classesbraid groupsnormal formsArtin groupsgenerating setscentralizersconjugacy problemGarside groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Cryptography (94A60) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (9)

On the centralizer of generic braids ⋮ The \(n\)th root of a braid is unique up to conjugacy. ⋮ Presentations of Dehn quandles ⋮ The center of pure complex braid groups. ⋮ Generalization of the Dehornoy-Lafont order complex to categories: application to exceptional braid groups ⋮ Conjugacy search in braid groups. From a braid-based cryptogrphy point of view ⋮ On the structure of the centralizer of a braid ⋮ Braids, their Properties and Generalizations ⋮ Hyperbolic structures for Artin-Tits groups of spherical type

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.

This page was built for publication: Computation of centralizers in braid groups and Garside groups.