Related papers: Rewriting Systems and Embedding of monoids in grou…
We show that, in certain circumstances, a Boolean ample monoid may be fully embedded into a Boolean inverse monoid in a way that generalizes how right reversible cancellative monoids may be embedded into groups. We use groupoids of…
A conjecture of Dehornoy claims that, given a presentation of an Artin-Tits group, every word that represents the identity can be transformed into the trivial word using the braid relations, together with certain rules (between pairs of…
Recent research of the author has given an explicit geometric description of free (two-sided) adequate semigroups and monoids, as sets of labelled directed trees under a natural combinatorial multiplication. In this paper we show that there…
This paper studies complete rewriting systems and biautomaticity for three interesting classes of finite-rank homogeneous monoids: Chinese monoids, hypoplactic monoids, and sylvester monoids. For Chinese monoids, we first give new…
The aim of this note is to prove that monoids $\mathrm{Mon}\langle a,b:aUb=b\rangle$, with $aUb$ of relative length 6, admit finite complete rewriting systems. This is some advance in the understanding the long-standing open problem whether…
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 prove by explicit construction that graph braid groups and most surface groups can be embedded in a natural way in right-angled Artin groups, and we point out some consequences of these embedding results. We also show that every…
We explicitly construct an embedding of a right-angled Artin group into a classical pure braid group. Using this we obtain a number of corollaries describing embeddings of arbitrary Artin groups into right-angled Artin groups and linearly…
Every tame, prime and alternating knot is equivalent to a tame, prime and alternating knot in regular position, with a common projection. In this work, we show that the Dehn presentation of the knot group of a tame, prime, alternating knot,…
In this article we study the right-angled Artin subgroups of a given right-angled Artin group. Starting with a graph $\gam$, we produce a new graph through a purely combinatorial procedure, and call it the extension graph $\gam^e$ of…
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating,…
A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…
We show that for a sufficiently simple surface $S$, a right-angled Artin group $A(\Gamma)$ embeds into $\Mod(S)$ if and only if $\Gamma$ embeds into the curve graph $\mC(S)$ as an induced subgraph. When $S$ is sufficiently complicated,…
This paper shows how to construct coherent presentations (presentations by generators, relations and relations among relations) of monoids admitting a right-noetherian Garside family. Thereby, it resolves the question of finding a unifying…
Right (and left) coherency and right (and left) weak coherency are natural finitary conditions for monoids. Determining whether or not a given monoid has any of these properties is historically a difficult problem. This paper has several…
We give an example of a monoid with finitely many left and right ideals, all of whose Schutzenberger groups are presentable by finite complete rewriting systems, and so each have finite derivation type, but such that the monoid itself does…
We investigate criteria ensuring that a one-relator group $G$ contains a right-angled Artin subgroup $A(\Gamma)$, corresponding to a finite graph $\Gamma$. In particular, we prove that if $\Gamma$ is a forest with at least one edge and the…
We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…
We describe a new approach to the Word Problem for Artin-Tits groups and, more generally, for the enveloping group U(M) of a monoid M in which any two elements admit a greatest common divisor. The method relies on a rewrite system R(M) that…
The construction of bases for quotients is an important problem. In this paper, applying the method of rewriting systems, we give a unified approach to construct sections---an alternative name for bases in semigroup theory---for quotients…