Related papers: Semilinear idempotent distributive l-monoids
In this paper we study structural properties of residuated lattices that are idempotent as monoids. We provide descriptions of the totally ordered members of this class and obtain counting theorems for the number of finite algebras in…
We completely classify all varieties of aperiodic monoids with commuting idempotents whose subvariety lattice is distributive.
We completely classify all varieties of aperiodic monoids with central idempotents whose subvariety lattice is distributive.
We prove that a commutative parasemifield S is additively idempotent provided that it is finitely generated as a semiring. Consequently, every proper commutative semifield T that is finitely generated as a semiring is either additively…
The sets of all neutral, distributive and lower-modular elements of the lattice of semigroup varieties are finite, countably infinite and uncountably infinite, respectively. In 2018, we established that there are precisely three neutral…
The authors [3] proved that the endomorphism semiring of a nontrivial semilattice is always subdirectly irreducible and described its monolith. Here we prove that the endomorphism semiring of a commutative inverse semigroup with at least…
We completely determine all varieties of monoids on whose free objects all fully invariant congruences or all fully invariant congruences contained in the least semilattice congruence permute. Along the way, we find several new monoid…
In this paper, we introduce the notion of Autometrized lattice ordered monoids (for short,AL-monoids) as a generalization to DRl-semi groups. We obtain the basic properties of AL-monoids. Also, we prove that Autometrized lattice ordered…
For a monoid $M$, we denote by $\mathbb G(M)$ the group of units, $\mathbb E(M)$ the submonoid generated by the idempotents, and $\mathbb G_L(M)$ and $\mathbb G_R(M)$ the submonoids consisting of all left or right units. Writing $\mathcal…
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 study rewriting properties of the column presentation of plactic monoid for any semisimple Lie algebra such as termination and confluence. Littelmann described this presentation using L-S paths generators. Thanks to the shapes of…
A variety is finitely universal if its lattice of subvarieties contains an isomorphic copy of every finite lattice. Examples of finitely universal varieties of semigroups have been available since the early 1970s, but it is unknown if there…
A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…
A commutative monoid $M$ is called a linearly orderable monoid if there exists a total order on $M$ that is compatible with the monoid operation. The finitary power monoid of a commutative monoid $M$ is the monoid consisting of all nonempty…
We begin by investigating the class of commutative unital rings in which no two distinct elements divide the same elements. We prove that this class forms a finitely axiomatizable, relatively ideal distributive quasivariety, and it equals…
We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to…
We establish a new sufficient condition under which a monoid is non-finitely based and apply this condition to Lee monoids $L_\ell^1$, obtained by adjoining an identity element to the semigroup generated by two idempotents $a$ and $b$…
A representation theorem is proved for De Morgan monoids that are (i) semilinear, i.e., subdirect products of totally ordered algebras, and (ii) negatively generated, i.e., generated by lower bounds of the neutral element. Using this…
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…
We survey the state of the art on amalgamation in varieties of semilinear residuated lattices. Our discussion emphasizes two prominent cases from which much insight into the general picture may be gleaned: idempotent varieties and their…