A cancellativity criterion for presented monoids

DOI10.1007/S00233-018-9971-0zbMATH Open1467.20047arXiv1802.04607OpenAlexW2963837456WikidataQ129138026 ScholiaQ129138026MaRDI QIDQ2334422FDOQ2334422

Authors: Patrick Dehornoy 

Publication date: 7 November 2019

Published in: Semigroup Forum (Search for Journal in Brave)

Abstract: We establish a new, fairly general cancellativity criterion for a presented monoid that properly extends the previously known related criteria. It is based on a new version of the word transformation called factor reversing, and its specificity is to avoid any restriction on the number of relations in the presentation. As an application, we deduce the cancellativity of some natural extension of Artin's braid monoid in which crossings are colored.

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

Recommendations

• On two problems related to cancellativity
• Cancellativity in finitely presented semigroups
• Presentations of cancellative monoids
• On uniform decision problems and abstract properties of small overlap monoids.
• A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative

zbMATH Keywords

word problemGarside monoidArtin-Tits groupssemigroup presentationgroup of fractionscancellativityrewrite systemmonoid embeddabilityVan Kampen diagram

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The subword reversing method.
• Linear equations in non-commutative fields
• THE BRAID GROUP AND OTHER GROUPS
• On the geometry of semigroup presentations
• Multifraction reduction. I: The 3-Ore case and Artin-Tits groups of type FC.
• Complete positive group presentations.
• Groups with a complemented presentation
• On completeness of word reversing
• ON WORD REVERSING IN BRAID GROUPS

Cited In (8)

• Title not available (Why is that?)
• A new Garside structure on torus knot groups and some complex braid groups
• Cancellation in primely generated refinement monoids.
• On some torus knot groups and submonoids of the braid groups
• Braids via term rewriting
• Garside combinatorics for Thompson's monoid \(F^+\) and a hybrid with the braid monoid \(B_{\infty }^{+}\)
• Quasi-isometry and finite presentations of left cancellative monoids.
• Right Noetherian semigroups

This page was built for publication: A cancellativity criterion for presented monoids

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