A New Approach to Extracting Roots in Garside Groups

DOI10.1080/00927870500542762zbMath1145.20019OpenAlexW2053992402MaRDI QIDQ5478689

Hao Zheng

Publication date: 13 July 2006

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

Full work available at URL: https://doi.org/10.1080/00927870500542762

zbMATH Keywords

braid groupseffective algorithmsGarside groupsroot extractionsuper summit setsultra summit sets

Mathematics Subject Classification ID

Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)

Cites Work

• Conjugacy problem for braid groups and Garside groups.
• The \(n\)th root of a braid is unique up to conjugacy.
• A new approach to the conjugacy problem in Garside groups.
• THE CONJUGACY PROBLEM IN SMALL GAUSSIAN GROUPS
• ALGORITHMS FOR POSITIVE BRAIDS
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• EXTRACTION OF ROOTS IN GARSIDE GROUPS
• The infimum, supremum, and geodesic length of a braid conjugacy class.

This page was built for publication: A New Approach to Extracting Roots in Garside Groups