The subword reversing method.

DOI10.1142/S0218196711006091MaRDI QIDQ2996840zbMATH OpenFDO

Authors Patrick Dehornoy

Publication date 3 May 2011

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

word problemrewriting systemssemigroup presentationsvan Kampen diagramsGarside monoidsArtin-Tits groupscancellative semigroupsalgorithmic problemsgroups of fractionsmonoid embeddability

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Braid groups; Artin groups (20F36) Free semigroups, generators and relations, word problems (20M05)

Abstract: We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good cases, the method provides a powerful tool for investigating presented (semi)groups. In particular, it leads to cancellativity and embeddability criteria for monoids and to efficient solutions for the word problem of monoids and groups of fractions.

Recommendations

• On completeness of word reversing
• Some properties of a class of polyhedral semigroups based upon the subword reversing method.
• Monoids of \(O\)-type, subword reversing, and ordered groups.
• ON WORD REVERSING IN BRAID GROUPS
• Comparing Gröbner-Shirshov bases and word reversing.

Cites work

• scientific article; zbMATH DE number 53657 (Why is no real title available?)
• scientific article; zbMATH DE number 53661 (Why is no real title available?)
• A class of Garside groupoid structures on the pure braid group
• A fast method for comparing braids
• A new approach to the conjugacy problem in Garside groups.
• A normal form for a class of monoids including the singular braid monoids
• ALGORITHMS FOR POSITIVE BRAIDS
• Artin monoids inject in their groups
• Artin-Gruppen und Coxeter-Gruppen
• Combinatorial group theory.
• Complete positive group presentations.
• Conjugacy problem for braid groups and Garside groups.
• Garside groups and Yang-Baxter equation.
• Garside monoids vs divisibility monoids
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• Groups with a complemented presentation
• Left-Garside categories, self-distributivity, and braids
• Les immeubles des groupes de tresses généralises
• On completeness of word reversing
• On the distance between the expressions of a permutation
• On the geometry of semigroup presentations
• On the rotation distance between binary trees
• THE BRAID GROUP AND OTHER GROUPS
• The Homological Algebra of Artin Groups.

Cited in

(20)

• Left regular representations of Garside categories I. C^*-algebras and groupoids
• An algorithmic approach to Hurwitz equivalences.
• The Yang–Baxter equation and Thompson’s group F
• Automaticity for graphs of groups
• On completeness of word reversing
• Rewriting systems in sufficiently large Artin-Tits groups.
• Addendum to: ``On some torus knot groups and submonoids of the braid groups
• Algorithms for Garside calculus
• Infinite examples of cancellative monoids that do not always have least common multiple.
• Multifraction reduction. IV: Padding and Artin-Tits monoids of sufficiently large type
• Cyclic amalgams, HNN extensions, and Garside one-relator groups
• Monoids of \(O\)-type, subword reversing, and ordered groups.
• Word problem of the Perkins semigroup via directed acyclic graphs.
• A cancellativity criterion for presented monoids
• A note on Garside monoids and \({\mathcal{M}} \)-braces
• A coherence theorem for pseudonatural transformations
• A conjecture about Artin-Tits groups.
• The braid shelf
• On some torus knot groups and submonoids of the braid groups
• Garside combinatorics for Thompson's monoid \(F^+\) and a hybrid with the braid monoid \(B_{\infty }^{+}\)

This page was built for publication: The subword reversing method.

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