Related papers: Monoid varieties with extreme properties
We completely classify all varieties of aperiodic monoids with commuting idempotents whose subvariety lattice is distributive.
An algebra that generates a variety with uncountably many subvarieties is said to be of type $2^{\aleph_0}$. We show that the Rees quotient monoid $M(aabb)$ of order ten is of type $2^{\aleph_0}$, thereby affirmatively answering a recent…
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…
Let M be a commutative monoid. We provide an explicit first-order formular that defines the variety generated by M in the lattice of commutative semigroup varieties.
If a finitely generated monoid M is defined by a finite number of degree-preserving relations, then it has linear growth if and only if it can be decomposed into a finite disjoint union of subsets (which we call "sandwiches") of the form…
Very little is known about the structure of the intersection of two $k$-generated monoids of words, even for $k=3$. Here we investigate the case of $k$-maximal monoids, that is, monoids whose basis of cardinality $k$ cannot be non-trivially…
A finitely generated commutative monoid is uniquely presented if it has only a minimal presentation. We give necessary and sufficient conditions for finitely generated, combinatorially finite, cancellative, commutative monoids to be…
We study the finite basis problem for additively idempotent semirings satisfying the identity $xy \approx xz$. Let $\mathbf{R}$ denote the variety of all such semirings. Yue et al. (2025, Algebra Universalis, DOI:10.1007/s00012-025-00908-5)…
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…
We characterize all residuated lattices that have height equal to $3$ and show that the variety they generate has continuum-many subvarieties. More generally, we study unilinear residuated lattices: their lattice is a union of disjoint…
We give a finite axiomatization for the variety generated by relational, integral ordered monoids. As a corollary we get a finite axiomatization for the language interpretation as well.
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…
We completely classify all neutral or costandard elements in the lattice $\mathbb{MON}$ of all monoid varieties. Further, we prove that an arbitrary upper-modular element of $\mathbb{MON}$ except the variety of all monoids is either a…
Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…
We study the maximal subgroups (also known as group $\mathcal{H}$-classes) of finitely presented special inverse monoids. We show that the maximal subgroups which can arise in such monoids are exactly the recursively presented groups, and…
We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating…
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…
A variety of algebras is called limit if it is non-finitely based but all its proper subvarieties are finitely based. We present a new pair of limit varieties of monoids and show that together with the five limit varieties of monoids…
We show that any graph product of residually finite monoids is residually finite. As a special case we obtain that any free product of residually finite monoids is residually finite. The corresponding results for graph products of…
We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, on some cardinals as large as the whole clone…