The paint pot problem and common multiples in monoids
Illustrated by a problem on paint pots that is easy to understand but hard to solve, a main goal of this paper is to investigate for which graphs the corresponding generalized braid monoid has common right multiples, in a self-contained way that also applies to monoids of other formats. As one result, the authors characterize generalized braid monoids represented by undirected graphs, being a subclass of Artin-Tits monoids. Stated in other words, the authors investigate to which graphs the old Garside result stating that braid monoids have the property of common right multiples, generalizes. This characterization also follows from old results on Coxeter groups and the connection between finiteness of Coxeter groups and common right multiples in Artin-Tits monoids. The main new contribution is a technique to prove that the property of common right multiples does not hold, by finding a particular model, in examples all being finite.
- Artin-Gruppen und Coxeter-Gruppen
- Braids and self-distributivity
- Braids via term rewriting
- Foundations of Garside theory
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 3327350 (Why is no real title available?)
- On generalized braid groups
- On theories with a combinatorial definition of 'equivalence'
- Random Descent
- Some properties of conversion.
- THE BRAID GROUP AND OTHER GROUPS
- The Complete Enumeration of Finite Groups of the Form Ri2=(RiRj)kij=1
- Theory of braids
This page was built for publication: The paint pot problem and common multiples in monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025946)
