A variety of algebras is called Cross if it is finitely based, finitely generated, and has finitely many subvarieties. In present article, we classify all Cross varieties of aperiodic monoids with commuting idempotents.
A variety of algebras is called limit if it is non-finitely based but all its proper subvarieties are finitely based. A monoid is aperiodic if all its subgroups are trivial. We classify all limit varieties of aperiodic monoids with commuting idempotents.
A limit variety is a variety that is minimal with respect to being non-finitely based. The two limit varieties of Marcel Jackson are the only known examples of limit varieties of aperiodic monoids. Our previous work had shown that there exists a limit subvariety of aperiodic monoids that is different from Marcel Jackson's limit varieties. In this paper, we introduce a new limit variety of aperiodic monoids.
We characterise the elements of the (maximum) idempotent generated subsemigroup of the Kauffman monoid in terms of combinatorial data associated to certain normal forms. We also calculate the smallest size of a generating set and idempotent generating set.
We calculate the rank and idempotent rank of the semigroup $E(X,P)$ generated by the idempotents of the semigroup $T(X,P)$, which consists of all transformations of the finite set $X$ preserving a non-uniform partition $P$. We also classify and enumerate the idempotent generating sets of this minimal possible size. This extends results of the first two authors in the uniform case.
We describe a formalism, using groupoids, for the study of rewriting for presentations of inverse monoids, that is based on the Squier complex construction for monoid presentations. We introduce the class of pseudoregular groupoids, an example of which now arises as the fundamental groupoid of our version of the Squier complex. A further key ingredient is the factorisation of the presentation map from a free inverse monoid as the composition of an idempotent pure map and an idempotent separating map. The relation module of a presentation is then defined as the abelianised kernel of this idempo…
We study the ideals of the partition, Brauer, and Jones monoid, establishing various combinatorial results on generating sets and idempotent generating sets via an analysis of their Graham--Houghton graphs. We show that each proper ideal of the partition monoid P_n is an idempotent generated semigroup, and obtain a formula for the minimal number of elements (and the minimal number of idempotent elements) needed to generate these semigroups. In particular, we show that these two numbers, which are called the rank and idempotent rank (respectively) of the semigroup, are equal to each other, and …
With each semigroup one can associate a partial algebra, called the biordered set, which captures important algebraic and geometric features of the structure of idempotents of that semigroup. For a biordered set $\mathcal{E}$, one can construct the free idempotent-generated semigroup over $\mathcal{E}$, $\mathsf{IG}(\mathcal{E})$, which is the free-est semigroup (in a definite categorical sense) whose biorder of idempotents is isomorphic to $\mathcal{E}$. Studies of these intriguing objects have been recently focusing on their particular aspects, such as maximal subgroups, the word problem, et…
Denote by $\mathcal T_n$ and $\mathcal S_n$ the full transformation semigroup and the symmetric group on the set $\{1,\ldots,n\}$, and $\mathcal E_n=\{1\}\cup(\mathcal T_n\setminus \mathcal S_n)$. Let $\mathcal T(X,\mathcal P)$ denote the set of all transformations of the finite set $X$ preserving a uniform partition $\mathcal P$ of $X$ into $m$ subsets of size $n$, where $m,n\geq2$. We enumerate the idempotents of $\mathcal T(X,\mathcal P)$, and describe the subsemigroup $S=\langle E\rangle$ generated by the idempotents $E=E(\mathcal T(X,\mathcal P))$. We show that $S=S_1\cup S_2$, where $S_1…
We study monoids generated by various combinations of idempotents and one- or two-sided units of an infinite partial Brauer monoid. This yields a total of eight such monoids, each with a natural characterisation in terms of relationships between parameters associated to Brauer graphs. We calculate the relative ranks of each monoid modulo any other such monoid it may contain, and then apply these results to determine the Sierpinski rank of each monoid, and ascertain which ones have the semigroup Bergman property. We also make some fundamental observations about idempotents and units in arbitrar…
We study the partial Brauer monoid and its planar submonoid, the Motzkin monoid. We conduct a thorough investigation of the structure of both monoids, providing information on normal forms, Green's relations, regularity, ideals, idempotent generation, minimal (idempotent) generating sets, and so on. We obtain necessary and sufficient conditions under which the ideals of these monoids are idempotent-generated. We find formulae for the rank (smallest size of a generating set) of each ideal, and for the idempotent rank (smallest size of an idempotent generating set) of the idempotent-generated su…
We investigate the structure of the twisted Brauer monoid $\mathcal B_n^τ$, comparing and contrasting it to the structure of the (untwisted) Brauer monoid $\mathcal B_n$. We characterise Green's relations and pre-orders on $\mathcal B_n^τ$, describe the lattice of ideals, and give necessary and sufficient conditions for an ideal to be idempotent-generated. We obtain formulae for the rank (smallest size of a generating set) and (where applicable) the idempotent rank (smallest size of an idempotent generating set) of each principal ideal; in particular, when an ideal is idempotent-generated, its…
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. Model theory provides us with saturated words in each such class, i.e., words in which all possible factorizations are realized. We give several applications of this new approach, including a solution to the word problem for $ω$-terms that avoids using McCammond's normal forms, as well as new proofs and extensions of other structural results concerning free…
The algebraic variety defined by the idempotents of an incidence monoid is investigated. Its irreducible components are determined. The intersection with an antichain submonoid is shown to be the union of these irreducible components. The antichain monoids of bipartite posets are shown to be orthodox semigroups. The Green's relations are explicitly determined, and applications to conjugacy problems are described. In particular, it is shown that two elements in the antichain monoid are primarily conjugate in the monoid if and only if they belong to the same $\mathcal{J}$-class and their multipl…
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 M$ for the (monoidal) category of monoids, $\mathbb G$, $\mathbb E$, $\mathbb G_L$ and $\mathbb G_R$ are all (monoidal) functors $\mathcal M\to\mathcal M$. There are other natural functors associated to submonoids generated by combinations of idempotents and one- or two-sided units. The above functors generate a monoid with composition as its operation. We sh…
We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the idempotents in the finite partition, Brauer and partial Brauer monoids, giving several formulae and recursions for the number of idempotents in each monoid as well as various $\mathscr R$-, $\mathscr L$- and $\mathscr D$-classes. We also apply our results to determine the number of idempotent basis elements in the finite dimensional partition, Brauer and partial Brauer algebras.
We show that every finite inverse monoid has an idempotent-separating cover by a finite F-inverse monoid. This provides a positive answer to a conjecture of Henckell and Rhodes.
We discuss residual finiteness and several related separability conditions for the class of monoid acts, namely weak subact separability, strong subact separability and complete separability. For each of these four separability conditions, we investigate which monoids have the property that all their (finitely generated) acts satisfy the condition. In particular, we prove that: all acts over a finite monoid are completely separable (and hence satisfy the other three separability conditions); all finitely generated acts over a finitely generated commutative monoid are residually finite and stro…
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 problem for Lee monoids $L_\ell^1$, obtained by adjoining an identity element to the semigroup generated by two idempotents $a$ and $b$ subjected to the relation $0=abab \cdots$ (length $\ell$). We also prove a syntactic sufficient condition which is equivalent to the sufficient condition of Lee under which a semigroup is non-finitely based. This gives a new …
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 generalize the results in [1,8,36,37] and to simplify their proofs. The method also allows to remove one of the requirements on the "special system of identities" used by P. Perkins in [16] to find the first two examples of finite non-finitely based semigroups. We use our method to prove eleven new sufficient conditions under which a monoid is non-finitely based…
Maximal subgroups of free projection- and idempotent-generated semigroups with applications to partition monoids
Centre for Research in Mathematics and Data Science, Western Sydney University(西悉尼大学数学与数据科学研究中心);School of Engineering, Mathematics and Physics, University of East Anglia(东英吉利大学工程、数学与物理学院);Mathematical Institute, School of Mathematics and Statistics, University of St Andrews(圣安德鲁斯大学数学与统计学院数学研究所)
We define a subsemigroup $S_n$ of the rook monoid $R_n$ and investigate its properties. To do this, we represent the nonzero elements of $S_n$ (which are $n\times n$ matrices) via certain triplets of integers, and develop a closed-form expression representing the product of two elements; these tools facilitate straightforward deductions of a great number of properties. For example, we show that $S_n$ consists solely of idempotents and nilpotents, find the numbers of idempotents and nilpotents, and compute nilpotency indexes. Furthermore, we give a necessary and sufficient condition for the $j$…
We study the language-theoretic properties of the word problem, in the sense of Duncan & Gilman, of weakly compressible monoids, as defined by Adian & Oganesian. We show that if $\mathcal{C}$ is a reversal-closed super-$\operatorname{AFL}$, as defined by Greibach, then $M$ has word problem in $\mathcal{C}$ if and only if its compressed left monoid $L(M)$ has word problem in $\mathcal{C}$. As a special case, we may take $\mathcal{C}$ to be the class of context-free or indexed languages. As a corollary, we find many new classes of monoids with decidable rational subset membership problem. Finall…
For a monoid $M$ and a subsemigroup $S$ of the full transformation semigroup $T_n$, the wreath product $M\wr S$ is defined to be the semidirect product $M^n\rtimes S$, with the coordinatewise action of $S$ on $M^n$. The full wreath product $M\wr T_n$ is isomorphic to the endomorphism monoid of the free $M$-act on $n$ generators. Here, we are particularly interested in the case that $S=Sing_n$ is the singular part of $T_n$, consisting of all non-invertible transformations. Our main results are presentations for $M\wr Sing_n$ in terms of certain natural generating sets, and we prove these via ge…
We obtain several presentations by generators and relations for the rook partition monoids and algebras, as well as their singular ideals. Among other results, we also calculate the minimal sizes of generating sets (some of our presentations use such minimal-size generating sets), and show that the singular part of the rook partition monoid is generated by its idempotents.
We give a construction of the projective indecomposable modules and a description of the quiver for a large class of monoid algebras including the algebra of any finite monoid whose principal right ideals have at most one idempotent generator. Our results include essentially all families of finite monoids for which this has been done previously, for example, left regular bands, $\mathscr J$-trivial and $\mathscr R$-trivial monoids and left regular bands of groups.
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$ subjected to the relation $0=abab \cdots$ (length $\ell$). We show that every monoid which generates a variety containing $L_5^1$ and is contained in the variety generated by $L_\ell^1$ for some $\ell \ge 5$ is non-finitely based. We establish this result by analyzing $τ$-terms for $M$ where $τ$ is certain non-trivial congruence on the free semigroup, that is, we…
Let $m,n\in \mathbb{N}$, and $V$ be a $m$-dimensional vector space over a field $F$ of characteristic $0$. Let $U=F\oplus V$ and $R_n$ be the rook monoid. In this paper, we construct a certain quasi-idempotent in the annihilator of $U^{\otimes n}$ in $FR_n$, which comes from some one-dimensional two-sided ideal of rook monoid algebra. We show that the two-sided ideal generated by this element is indeed the whole annihilator of $U^{\otimes n}$ in $FR_n$.
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 product of two free monoids to be finitely generated, and show that all such fiber products are also finitely presented. By way of contrast, we show that fiber products of free semigroups over finite fiber quotients are never finitely generated. We then consider fiber products of free semigroups over infinite semigroups, and show that for such a fiber product to …