Algorithms for Garside calculus

DOI10.1016/J.JSC.2013.11.001MaRDI QIDQ2252115zbMATH OpenOpenAlexFDO

Authors Patrick Dehornoy, Volker Gebhardt

Publication date 16 July 2014

Published in Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

normal formword problemGarside familygermcategory presentationGarside calculusgroupoid of fractions

Mathematics Subject Classification ID

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

Abstract: Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more general contexts, the latest one being that of categories and what are called Garside families. One of the benefits of this theory is to lead to algorithms solving effectively the naturally occurring problems, typically the Word Problem. The aim of this paper is to present and solve these algorithmic questions in the new extended framework.

Recommendations

• Garside and quadratic normalisation: a survey
• Groupes de Garside
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• Solving the conjugacy problem in Garside groups by cyclic sliding.
• Conjugacy problem for braid groups and Garside groups.

Cites work

• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 53661 (Why is no real title available?)
• scientific article; zbMATH DE number 3627183 (Why is no real title available?)
• A class of Garside groupoid structures on the pure braid group
• A new approach to the conjugacy problem in Garside groups.
• ALGORITHMS FOR POSITIVE BRAIDS
• Artin groups of finite type are biautomatic
• Artin-Gruppen und Coxeter-Gruppen
• Braids and self-distributivity
• Complete positive group presentations.
• Efficient solutions to the braid isotopy problem.
• Fragments of the word \(\Delta\) in a braid group
• Garside families and Garside germs
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• Groupes de Garside
• Groups with a complemented presentation
• Les immeubles des groupes de tresses généralises
• Monoids of \(O\)-type, subword reversing, and ordered groups.
• Solving the conjugacy problem in Garside groups by cyclic sliding.
• THE BRAID GROUP AND OTHER GROUPS
• The subword reversing method.
• Theory of braids

Cited in

(3)

• Garside and quadratic normalisation: a survey
• Foundations of Garside theory
• On parabolic subgroups of Artin-Tits groups of spherical type

This page was built for publication: Algorithms for Garside calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252115)