A variety is finitely universal if its lattice of subvarieties contains an isomorphic copy of every finite lattice. We show that the 6-element Brandt monoid generates a finitely universal variety of monoids and, by the previous results, it is the smallest generator for a monoid variety with this property. It is also deduced that the join of two Cross varieties of monoids can be finitely universal. In particular, we exhibit a finitely universal variety of monoids with uncountably many subvarieties which is the join of two Cross varieties of monoids whose lattices of subvarieties are the 6-element and the 7-element chains, respectively.

A notion of normal submonoid of a monoid M is introduced that generalizes the normal subgroups of a group. When ordered by inclusion, the set $\mathsf {NorSub}(M)$ of normal submonoids of M is a complete lattice. Joins are explicitly described and the lattice is computed for the finite full transformation monoids $T_n$, $n\geq ~1$. It is also shown that $\mathsf {NorSub}(M)$ is modular for a specific family of commutative monoids, including all Krull monoids, and that it, as a join semilattice, embeds isomorphically onto a join subsemilattice of the lattice $\mathsf {Cong}(M)$ of congruences on M. This leads to a new strategy for computing $\mathsf {Cong}(M)$ consisting of computing $\mathsf {NorSub}(M)$ and the so-called unital congruences on the quotients of M modulo its normal submonoids. This provides a new perspective on Malcev’s computation of the congruences on $T_n$.

An example of a nonfinitely based involution monoid of order five has recently been discovered. We confirm that this example is, up to isomorphism, the unique smallest among all involution monoids.

We say that two elements of a group or semigroup are $\Bbbk$-linear conjugates if their images under any linear representation over $\Bbbk$ are conjugate matrices. In this paper we characterize $\Bbbk$-linear conjugacy for finite semigroups (and, in particular, for finite groups) over an arbitrary field $\Bbbk$.

Let $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}S$ be a semigroup. Elements $a,b$ of $S$ are $\widetilde{\mathscr{R}}$-related if they have the same idempotent left identities. Then $S$ is weakly left ample if (1) idempotents of $S$ commute, (2) $\widetilde{\mathscr{R}}$ is a left congruence, (3) for any $a \in S$, $a$ is $\widetilde{\mathscr{R}}$-related to a (unique) idempotent, say $a^+$, and (4) for any element $a$ and idempotent $e$ of $S$, $ae=(ae)^+a$. Elements $a,b$ of $S$ are $\mathscr{R}^*$-related if, for any $x,y \in S^1$, $xa=ya$ if and only if $xb=yb$. Then $S$ is left ample if it satisfies (1), (3) and (4) relative to $\mathscr{R}^*$ instead of $\widetilde{\mathscr{R}}$. Further, $S$ is (weakly) ample if it is both (weakly) left and right ample. We establish several characterizations of these classes of semigroups. For weakly left ample ones we provide a construction of all such semigroups with zero all of whose nonzero idempotents are primitive. Among characterizations of weakly ample semigroups figure (strong) semilattices of unipotent monoids, and among those for ample semigroups, (strong) semilattices of cancellative monoids. This describes the structure of these two classes of semigroups in an optimal way, while, for the ‘one-sided’ case, the problem of structure remains open.

In this paper, we characterise the quasi-strong endomorphisms of the join of split graphs. We give conditions under which the quasi-strong endomorphisms of the join of split graphs form a monoid.

We classify semigroups in the title according to whether they have a finite or an infinite number ofℒ-classes or ℛ-classes. For each case, we provide a concrete construction using Rees matrix semigroups and their translational hulls. An appropriate relatively free semigroup is used to complete the classification. All this is achieved by first treating the special case in which one of the generators is idempotent. We conclude by a discussion of a possible classification of 2-generator completely regular semigroups.