Algorithms for Garside calculus

DOI10.1016/J.JSC.2013.11.001zbMATH Open1357.20012arXiv1301.3277OpenAlexW2168405922MaRDI QIDQ2252115FDOQ2252115

Authors: Patrick Dehornoy, Volker Gebhardt 

Publication date: 16 July 2014

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

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.

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

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.

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)

Cites Work

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

Cited In (3)

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

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)