Related papers: Free left and right adequate semigroups
This paper is the first of a sequence of three papers, where the concept of an $\mathbb R$-tree dual to a measured geodesic lamination in a hyperbolic surface is generalized to arbitrary $\mathbb R$-trees provided with a (very small) action…
We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…
This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…
This article studies the properties of word-hyperbolic semigroups and monoids, i.e. those having context-free multiplication tables with respect to a regular combing, as defined by Duncan & Gilman. In particular, the preservation of…
In this article, we prove that embeddings of right-angled Artin group $A_1$ on the complement of a linear forest into another right-angled Artin group $A_2$ can be reduced to full embeddings of the defining graph of $A_1$ into the extension…
This work is dedicated to the results were got in the model theory of the regular polygons. We give the characterization of the monoids with axiomatizable and model complete class of regular polygons. We describe the monoids with complete…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
Inspired by methods in prime characteristic in commutative algebra, we introduce and study combinatorial invariants of seminormal monoids. We relate such numbers with the singularities and homological invariants of the semigroup ring…
Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.
In this paper we consider the questions of which topological semigroups embed topologically into the full transformation monoid $\mathbb{N} ^ \mathbb{N}$ or the symmetric inverse monoid $I_{\mathbb{N}}$ with their respective canonical…
Monads and their composition via distributive laws have many applications in program semantics and functional programming. For many interesting monads, distributive laws fail to exist, and this has motivated investigations into weaker…
We give a sufficient condition for a sequence of normal subgroups of a free group to have the property that both, their growths tend to the upper bound and their cogrowths tend to the lower bound. The condition is represented by planarity…
Let $<X>$ be the free monoid on a generating set $X$, and suppose one adjoins to $<X>$ universal 2-sided inverses to a finite set $S$ of its elements. We note an elementary algorithm which yields a normal form for elements of the resulting…
We apply Stone duality and model theory to study the structure theory of free pro-aperiodic monoids. Stone duality implies that elements of the free pro-aperiodic monoid may be viewed as elementary equivalence classes of pseudofinite words.…
Free idempotent generated semigroups IG$(E)$, where $E$ is a biordered set, have provided a focus of recent research, the majority of the efforts concentrating on the behaviour of the maximal subgroups. Inspired by an example of Brittenham,…
We generalize presentations of the fundamental group of discriminant complements and arrive at a class of presentations associated naturally with words in the free monoid of the alphabet $\sigma_1,\dots,\sigma_{n-1}$. Our study addresses…
We prove the equivalence between a relative bottleneck property and being quasi-isometric to a tree-graded space. As a consequence, we deduce that the quasi-trees of spaces defined axiomatically by Bestvina-Bromberg-Fujiwara are…
We introduce a new class of semigroups arising from a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups." We show that the class of synchronous automaton semigroups is strictly contained in…
We extend the theory of Sweeder's measuring comonoids to the framework of duoidal categories: categories equipped with two compatible monoidal structures. We use one of the tensor products to endow the category of monoids for the other with…
Graph products of monoids provide a common framework for direct and free products, and graph monoids (also known as free partially commutative monoids). If the monoids in question are groups, then any graph product is, of course, a group.…