EXTRACTION OF ROOTS IN GARSIDE GROUPS

DOI10.1081/AGB-120003997zbMath1007.20036OpenAlexW2020502548MaRDI QIDQ4552432

Hervé Sibert

Publication date: 3 September 2002

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1081/agb-120003997

zbMATH Keywords

rootsconjugacy classesbraid groupsArtin groupsword problemconjugacy problemGarside groups

Mathematics Subject Classification ID

Conjugacy classes for groups (20E45) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

The \(n\)th root of a braid is unique up to conjugacy., Tame Garside monoids., Cyclic amalgams, HNN extensions, and Garside one-relator groups, Garside groups are strongly translation discrete., Homology of Gaussian groups., Periodic elements in Garside groups., Elementary equivalence in Artin groups of finite type, On the structure of the centralizer of a braid, Entity authentication schemes using braid word reduction, An algorithmic construction of group automorphisms and the quantum Yang-Baxter equation, Translation numbers in a Garside group are rational with uniformly bounded denominators., A New Approach to Extracting Roots in Garside Groups

Cites Work

• Unnamed Item
• Artin-Gruppen und Coxeter-Gruppen
• THE CONJUGACY PROBLEM IN SMALL GAUSSIAN GROUPS
• ALGORITHMS FOR POSITIVE BRAIDS
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• THE BRAID GROUP AND OTHER GROUPS