Related papers: Rewriting Systems and Embedding of monoids in grou…
The Tits Conjecture, proved by Crisp and Paris, states that squares of the standard generators of any Artin group generate an obvious right-angled Artin subgroup. We consider a larger set of elements consisting of all the centers of the…
The first author showed in a previous paper that there is a correspondence between self-similar group actions and a class of left cancellative monoids called left Rees monoids. These monoids can be constructed either directly from the…
Let $M$ be a monoid that is embeddable in a group. We consider the topos $\mathbf{PSh}(M)$ of sets equipped with a right $M$-action, and we study the subtoposes that are of monoid type, i.e. the subtoposes that are again of the form…
A semigroup $S$ is said to be right pseudo-finite if the universal right congruence can be generated by a finite set $U\subseteq S\times S$, and there is a bound on the length of derivations for an arbitrary pair $(s,t)\in S\times S$ as a…
The present article continues the study of median groups initiated in [6, 9, 10]. Some classes of median groups are introduced and investigated with a stress upon the class of the so called A-groups which contains as remarkable subclasses…
Finite-above inverse monoids are a common generalization of finite inverse monoids and Margolis--Meakin expansions of groups. Given a finite-above $E$-unitary inverse monoid $M$ and a group variety $\mathit{U}$, we find a condition for $M$…
The basic method of rewriting for words in a free monoid given a monoid presentation is extended to rewriting for paths in a free category given a `Kan extension presentation'. This is related to work of Carmody-Walters on the Todd-Coxeter…
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…
By introducing branching conditions on the defining graph, we prove a range of rigidity results for quasiisometric embeddings between right-angled Artin groups. The starting point for these is that, under mild conditions on the codomain,…
Eklund et al. (2002) present a graphical technique aimed at simplifying the verification of various category-theoretic constructions, notably the composition of monads. In this note we take a different approach involving string rewriting.…
We construct quasi-isometric embeddings from right-angled Artin groups into the outer automorphism group of a free group. These homomorphisms are in analogy with those constructed in \cite{CLM}, where the target group is the mapping class…
In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we…
We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…
This paper introduces a new term rewriting system that is similar to the embedded read-back mechanism for interaction nets presented in our previous work, but is easier to follow than in the original setting and thus to analyze its…
In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…
We classify the Artin groups that admit retractions onto all of their parabolic subgroups. Our approach relies on a detailed analysis of triangular subgroups, with a key ingredient being the classification of homomorphisms between dihedral…
For every finitely generated free group we construct an explicit left order extending the lexicographic order on the free monoid generated by the positive letters. The order is defined by a left, free action on the orbit of 0 of a free…
For a finite simplicial graph $\Gamma$, let $A(\Gamma)$ denote the right-angled Artin group on $\Gamma$. Recently Kim and Koberda introduced the extension graph $\Gamma^e$ for $\Gamma$, and established the Extension Graph Theorem: for…
Every $F$-inverse monoid can be equipped with the unary operation which maps each element to the maximum element of its $\sigma$-class. In this enriched signature, the class of all $F$-inverse monoids forms a variety of algebraic…
We investigate the new, Turing-complete class of layered systems, whose lefthand sides of rules can only be overlapped at a multiset of disjoint or equal positions. Layered systems define a natural notion of rank for terms: the maximal…