Related papers: Lee monoids are non-finitely based while the sets …
We establish a new sufficient condition under which a monoid is non-finitely based and apply this condition to show that the 9-element monoid $L_4^1$ is non-finitely based. The monoid $L_4^1$ was the only unsolved case in the finite basis…
We present a general method for proving that a semigroup is non-finitely based. The method is strong enough to cover the non-finite basis arguments in articles [1,3,4,5,7,8, 11,14,16,21,27,31,36,37]. In particular, the method allows to…
We present a method for proving that a semigroup is finitely based and find some new sufficient conditions under which a monoid is finitely based. As an application, we find a class of finite monoids where the finite basis property behaves…
A limit variety is a variety that is minimal with respect to being non-finitely based. We present a new limit variety of aperiodic monoid. We also show that if there exists any other limit variety of aperiodic monoids, then it is contained…
Jackson and Lee proved that certain six-element monoid generates a hereditarily finitely based variety $\mathbb E^1$ whose lattice of subvarieties contains an infinite ascending chain. We identify syntactic monoids which generate finitely…
A finite semigroup is finitely related (has finite degree) if its term functions are determined by a finite set of finitary relations. For example, it is known that all nilpotent semigroups are finitely related. A nilpotent monoid is a…
We transform the method of Glasson into a sufficient condition under which a monoid is non-finitely related, add a new member to the collection of interlocking word-patterns, and use it to show that the monoid $M(ab^2a, a^2b^2)$ is…
We prove a representation theorem for totally ordered idempotent monoids via a nested sum construction. Using this representation theorem we obtain a characterization of the subdirectly irreducible members of the variety of semilinear…
An algebra is finitely related (or has finite degree) if its term functions are determined by some finite set of finitary relations. Nilpotent monoids built from words, via Rees quotients of free monoids, have been used to exhibit many…
Let $\mathfrak A$ be an alphabet and $W$ be a set of words in the free monoid ${\mathfrak A}^*$. Let $S(W)$ denote the Rees quotient over the ideal of ${\mathfrak A}^*$ consisting of all words that are not subwords of words in $W$. A set of…
We prove a sufficient condition under which a semigroup admits no finite identity basis. As an application, it is shown that the identities of the Kauffman monoid $\mathcal{K}_n$ are nonfinitely based for each $n\ge 3$. This result holds…
We show that the 42-element monoid of all partial order preserving and extensive injections on the 4-element chain is not contained in any variety generated by a finitely based finite $\mathcal{R}$-trivial semigroup. This provides unified…
Up to isomorphism, there exist two non-isomorphic two-element monoids. We show that the identities of the free product of every pair of such monoids admit no finite basis.
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…
We consider necessary and sufficient conditions for finite generation and finite presentability for fiber products of free semigroups and free monoids. We give a necessary and sufficient condition on finite fiber quotients for a fiber…
A finitely generated group or monoid is said to be context-free if it has context-free word problem. In this note, we give an example of a context-free monoid, none of whose maximal subgroups are finitely generated. This answers a question…
Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid…
We present some general results implying nonfinite axiomatisability of many additively idempotent semirings with finitely based semigroup reducts. The smallest is a $3$-element commutative example, which we show also has \texttt{NP}-hard…
Stalactic, taiga, sylvester and Baxter monoids arise from the combinatorics of tableaux by identifying words over a fixed ordered alphabet whenever they produce the same tableau via some insertion algorithm. In this paper, three sufficient…
We introduce several classes of monoids satisfying up to five axioms and establish basic theories on their arithmetics. The one satisfying all the axioms is named natural monoid. Two typical examples are 1) the monoid $\mathbb{N}$ of…