Related papers: Free left and right adequate semigroups
We prove that an arbitrary right-angled Artin group $G$ admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, $G$ admits quasi-isometric group embeddings into a pure…
A semigroup $S$ is right noetherian if every right congruence on $S$ is finitely generated. In this paper we present some fundamental properties of right noetherian semigroups, discuss how semigroups relate to their substructures with…
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…
Several authors have studied the question of when the monoid ring DM of a monoid M over a ring D is a right and/or left fir (free ideal ring), a semifir, or a 2-fir (definitions recalled in section 1). It is known that for M nontrivial, a…
To any free group automorphism, we associate a real pretree with several nice properties. First, it has a rigid/non-nesting action of the free group with trivial arc stabilizers. Secondly, there is an expanding pretree-automorphism of the…
Here we characterize regular and completely regular ordered semigroups by their minimal bi-ideals. A minimal bi-ideal is expressed as a product of a minimal right ideal and a minimal left ideal. Furthermore, we show that every bi-ideal in a…
Right groups are direct products of right zero semigroups and groups and they play a significant role in the semilattice decomposition theory of semigroups. Right groups can be characterized as associative right quasigroups (magmas in which…
Ideal series of semigroups play an important role in the examination of semigroups which have proper two-sided ideals. But the corresponding theorems cannot be used when left simple (or right simple or simple) semigroups are considered. So…
We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…
A monoid is said to be special if it admits a presentation in which all defining relations are of the form $w = 1$. Groups are familiar examples of special monoids. This article studies the geometric and structural properties of the Cayley…
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 construct a multiset space $\mathbb{N}[X]$ over a metric space $X$ that simultaneously enjoys desirable topological properties and admits a natural matching metric $d_{\mathbb{N}[X]}$, making it a metrizable abelian topological monoid…
In this paper, a connection between rewriting systems and embedding of monoids in groups is found. We show that if a group with a positive presentation has a complete rewriting system $\Re$ that satisfies the condition that each rule in…
We prove a fix point theorem for monoids of self-embeddings of trees. As a corollary, we obtain a result by Laflamme, Pouzet and Sauer that a tree either contains a subdivided binary tree as a subtree or has a vertex, and edge, an end or…
We introduce semidirect products of skew monoidal categories as a categorification of semidirect products of monoids (or, perhaps more familiarly, of groups). We also discuss how this construction interacts with monoidal, autonomous and…
We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagrams annotated by objects and morphisms from the original…
Takahasi's theorem on chains of subgroups of bounded rank in a free group is generalized to several classes of semigroups. As an application, it is proved that the subsemigroups of periodic points are finitely generated and periodic orbits…
A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…
This is the second part of a series of three articles which introduce laminations for free groups (see math.GR/0609416 for the first part). Several definition of the dual lamination of a very small action of a free group on an $\R$-tree are…
We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…