Related papers: Garside monoids vs divisibility monoids
We completely determine all varieties of monoids on whose free objects all fully invariant congruences or all fully invariant congruences contained in the least semilattice congruence permute. Along the way, we find several new monoid…
We define new presentations for elliptic Artin groups. We also show that the elliptic monoids defined by these presentations are cancellative. This solves the failure of cancellativity for the presentations of elliptic Artin monoids that…
A monoid $K$ is the internal Zappa-Sz\'ep product of two submonoids, if every element of $K$ admits a unique factorisation as the product of one element of each of the submonoids in a given order. This definition yields actions of the…
Several distinct Garside monoids having torus knot groups as groups of fractions are known. For $n,m\geq 2$ two coprime integers, we introduce a new Garside monoid $\mathcal{M}(n,m)$ having as Garside group the $(n,m)$-torus knot group,…
A Garside group is a group admitting a finite lattice generating set D. Using techniques developed by Bestvina for Artin groups of finite type, we construct K(\pi,1)s for Garside groups. This construction shows that the (co)homology of any…
The aim of this paper is sketch a theory of divisibility and factorisation in topological monoids, where finite products are replaced by convergent products. The algebraic case can then be viewed as the special case of discretely…
In Artin-Tits groups attached to Coxeter groups of spherical type, we give a combinatorial formula to express the simple elements of the dual braid monoids in the classical Artin generators. Every simple dual braid is obtained by lifting an…
After a review of the concept of "monad with arities" we show that the category of algebras for such a monad has a canonical dense generator. This is used to extend the correspondence between finitary monads on sets and Lawvere's algebraic…
Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to…
We give a complete description of the congruence lattices of the following finite diagram monoids: the partition monoid, the planar partition monoid, the Brauer monoid, the Jones monoid (also known as the Temperley-Lieb monoid), the Motzkin…
We propose a slight weakening of the definitions of Artin monoids and Coxeter monoids. We study one `infinite series' in detail.
We give an algorithm to decide if a given braid is a product of two factors which are conjugates of given powers of standard generators of the braid group. The same problem is solved in a certain class of Garside groups including Artin-Tits…
We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very particular structure.…
We introduce a class of inverse monoids, called Tarski monoids, that can be regarded as non-commutative generalizations of the unique countable, atomless Boolean algebra. These inverse monoids are related to a class of etale topological…
A magmoid is a non-empty set with a partial binary operation; group-like magmoids generalize group-like magmas such as semigroups, monoids and groups. In this article, we first consider the many ways in which the notions of associative…
In this technical report we describe a general class of monoids for which (sub)sequential rational can be characterised in terms of a congruence relation in the flavour of Myhill-Nerode relation. The class of monoids that we consider can be…
In the general context of presentations of monoids, we study normalisation processes that are determined by their restriction to length-two words. Garside's greedy normal forms and quadratic convergent rewriting systems, in particular those…
Right-reversing is an algorithm used to compute least common multiples in monoids that admit a right-complemented presentation. The algorithm can either terminate and find a result, fail, or run indefinitely. The correctness of the…
A monoid hypersurface is an irreducible hypersurface of degree d which has a singular point of multiplicity d-1. Any monoid hypersurface admits a rational parameterization, hence is of potential interest in computer aided geometric design.…
Under non-commutative Stone duality, there is a correspondence between second countable Hausdorff \'etale groupoids which have a Cantor space of identities and what we call Tarski inverse monoids: that is, countable Boolean inverse…