THE SUBWORD REVERSING METHOD
From MaRDI portal
Publication:2996840
DOI10.1142/S0218196711006091zbMath1256.20053arXiv0912.4272MaRDI QIDQ2996840
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
word problemrewriting systemssemigroup presentationsgroups of fractionsvan Kampen diagramsGarside monoidsArtin-Tits groupscancellative semigroupsalgorithmic problemsmonoid embeddability
Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Braid groups; Artin groups (20F36)
Related Items
A conjecture about Artin-Tits groups. ⋮ Rewriting systems in sufficiently large Artin-Tits groups. ⋮ On some torus knot groups and submonoids of the braid groups ⋮ Cyclic amalgams, HNN extensions, and Garside one-relator groups ⋮ Multifraction reduction. IV: Padding and Artin-Tits monoids of sufficiently large type ⋮ A note on Garside monoids and \({\mathcal{M}} \)-braces ⋮ The Yang–Baxter equation and Thompson’s group F ⋮ Left regular representations of Garside categories I. C*-algebras and groupoids ⋮ Addendum to: ``On some torus knot groups and submonoids of the braid groups ⋮ An algorithmic approach to Hurwitz equivalences. ⋮ A coherence theorem for pseudonatural transformations ⋮ Automaticity for graphs of groups ⋮ Algorithms for Garside calculus ⋮ Infinite examples of cancellative monoids that do not always have least common multiple. ⋮ The braid shelf ⋮ Garside combinatorics for Thompson's monoid \(F^+\) and a hybrid with the braid monoid \(B_{\infty }^{+}\) ⋮ A cancellativity criterion for presented monoids
Cites Work
- Unnamed Item
- Unnamed Item
- A fast method for comparing braids
- Groups with a complemented presentation
- On the distance between the expressions of a permutation
- On the rotation distance between binary trees
- Left-Garside categories, self-distributivity, and braids
- On the geometry of semigroup presentations
- Conjugacy problem for braid groups and Garside groups.
- Complete positive group presentations.
- On completeness of word reversing
- Combinatorial group theory.
- Artin monoids inject in their groups
- A normal form for a class of monoids including the singular braid monoids
- Les immeubles des groupes de tresses généralises
- Artin-Gruppen und Coxeter-Gruppen
- A new approach to the conjugacy problem in Garside groups.
- Garside Groups and Yang–Baxter Equation
- A class of Garside groupoid structures on the pure braid group
- ALGORITHMS FOR POSITIVE BRAIDS
- Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
- Garside monoids vs divisibility monoids
- The Homological Algebra of Artin Groups.
- THE BRAID GROUP AND OTHER GROUPS