Related papers: Monoids of O-type, subword reversing, and ordered …
A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the…
The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the…
A subcategory $\textbf{C}$ of a groupoid $\mathbb{G}$ is a left order in $\mathbb{G}$, if every element of $\mathbb{G}$ can be written as $a^{-1}b$ where $a, b \in \textbf{C}$. A subsemigroupoid $\mathfrak{C}$ of a groupoid $\mathbb{G}$ is…
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…
In this paper we compute the rank and exhibit a presentation for the monoids of all $P$-stable and $P$-order preserving partial permutations on a finite set $\Omega$, with $P$ an ordered uniform partition of $\Omega$. These (inverse)…
We prove that every countable left-ordered group embeds into a finitely generated left-ordered simple group. Moreover, if the first group has a computable left-order, then the simple group also has a computable left-order. We also obtain a…
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…
We give sufficient conditions for left- and bi-orderability of fundamental groups of Ore categories in terms of indirect factors, including Thompson groups and many of their generalizations. Besides recovering known results, we prove that…
We study left orderings on countably generated groups. In particular, we construct left orderings of inductive limits of amalgamated free products by using isolated left orderings of the groups appearing in the inductive system. Moreover,…
We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…
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…
We show that being finitely presentable and being finitely presentable with solvable word problem are quasi-isometry invariants of finitely generated left cancellative monoids. Our main tool is an elementary, but useful, geometric…
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…
The compressed word problem for a finitely generated monoid M asks whether two given compressed words over the generators of M represent the same element of M. For string compression, straight-line programs, i.e., context-free grammars that…
A regular ordered semigroup $S$ is called right inverse if every principal left ideal of $S$ is generated by an $\mathcal{R}$-unique ordered idempotent. Here we explore the theory of right inverse ordered semigroups. We show that a regular…
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…
This article is devoted to the investigation of the deformation (twisting) of monoidal structures, such as the associativity constraint of the monoidal category and the monoidal structure of monoidal functor. The sets of twistings have a…
We construct a class of Garside groupoid structures on the pure braid groups, one for each function (called labelling) from the punctures to the integers greater than 1. The object set of the groupoid is the set of ball decompositions of…
A totally ordered monoid, or tomonoid for short, is a monoid endowed with a compatible total order. We deal in this paper with tomonoids that are finite and negative, where negativity means that the monoidal identity is the top element.…
We construct free monoids in a monoidal category with finite limits and countable colimits, in which tensoring on either side preserves reflexive coequalizers and colimits of countable chains.