Multifraction reduction. III: The case of interval monoids

DOI10.4171/JCA/1-4-1MaRDI QIDQ1687823zbMATH OpenFDO

Authors Patrick Dehornoy, Friedrich Wehrung

Publication date 4 January 2018

Published in Journal of Combinatorial Algebra (Search for Journal in Brave)

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

zbMATH Keywords

circuitembeddabilityenveloping groupgcd-monoidintervalmonoidmultifractionposetreductionsemi-convergenceword problemzigzag

Mathematics Subject Classification ID

Semilattices (06A12) Preorders, orders, domains and lattices (viewed as categories) (18B35) Groupoids, semigroupoids, semigroups, groups (viewed as categories) (18B40) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42)

Abstract: We investigate gcd-monoids, which are cancellative monoids in which any two elements admit a left and a right gcd, and the associated reduction of multifractions (arXiv:1606.08991 and 1606.08995), a general approach to the word problem for the enveloping group. Here we consider the particular case of interval monoids associated with finite posets. In this way, we construct gcd-monoids, in which reduction of multifractions has prescribed properties not yet known to be compatible: semi-convergence of reduction without convergence, semi-convergence up to some level but not beyond, non-embeddability into the enveloping group (a strong negation of semi-convergence).

Review text

Summary: We investigate gcd-monoids, which are cancellative monoids in which any two elements admit a left and a right gcd, and the associated reduction of multifractions [the first author, J. Comb. Algebra 1, No. 2, 185--228 (2017; Zbl 1422.20020); ibid. 1, No. 3, 229--287 (2017; Zbl 1422.20021)], a general approach to the word problemfor the enveloping group. Here we consider the particular case of interval monoids associated with finite posets. In this way, we construct gcd-monoids, in which reduction of multifractions has prescribed properties not yet known to be compatible: semi-convergence of reductionwithout convergence, semi-convergence up to some level but not beyond, non-embeddability into the enveloping group (a strong negation of semi-convergence).

Recommendations

• Multifraction reduction. II: Conjectures for Artin-Tits groups
• Gcd-monoids arising from homotopy groupoids
• Multifraction reduction. I: The 3-Ore case and Artin-Tits groups of type FC.
• Monoids of intervals of ordered abelian groups
• Infinite examples of cancellative monoids that do not always have least common multiple.

Cited in

(7)

• Multifraction reduction. IV: Padding and Artin-Tits monoids of sufficiently large type
• Gcd-monoids arising from homotopy groupoids
• scientific article; zbMATH DE number 3910655 (Why is no real title available?)
• Some computational aspects in the work of Patrick Dehornoy
• Garside groups and geometry: Some thoughts for Patrick Dehornoy
• A collection of cancellative, singly aligned, non-group embeddable monoids
• Normal coactions extend to the C*-envelope

This page was built for publication: Multifraction reduction. III: The case of interval monoids

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