The subword reversing method.

DOI10.1142/S0218196711006091zbMATH Open1256.20053arXiv0912.4272MaRDI QIDQ2996840FDOQ2996840

Authors: Patrick Dehornoy 

Publication date: 3 May 2011

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

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.

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

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.

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)

Cites Work

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

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
• Addendum to: ``On some torus knot groups and submonoids of the braid groups
• On completeness of word reversing
• Rewriting systems in sufficiently large Artin-Tits 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
• The braid shelf
• A conjecture about Artin-Tits groups.
• 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)