Green's relations on the deformed finite inverse symmetric semigroup $\mathcal{IS}_n$ and the deformed finite symmetric semigroup $\mathcal{T}_n$ are described.
We prove new results on inheritance of Green's relations by subsemigroups in the presence of stability of elements. We provide counterexamples in other cases to show in particular that not all right-stable semigroups are embeddable in left-stable semigroups. This is carried out in the context of a survey of the various closely related notions of stability and minimality of Green's classes that have appeared in the literature over the last sixty years, and which have sometimes been presented in different forms.
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to which these results apply include many important classes: transformation semigroups, partial permutation semigroups and inverse semigroups, partition monoids, matrix semigroups, and subsemigroups of finite regular Rees matrix and $0$-matrix semigroups over groups. For any subsemigroup of such a semigroup, it is possible to, among other things, efficiently co…
We prove that if $S$ is a $le$-semigroup in which left ideal elements commute (condition which is called $\mathbfΛ$), then any $\mathcal{J}$-class satisfying the Green condition is a subsemigroup of $S$. As a corollary of this we show that semisimple $le$-semigroups satisfying $\mathbfΛ$ are precisely those that decompose as a semilattice of left simple $\vee e$-semigroups which are in addition semisimple, intra-regular and satisfy $\mathbfΛ$.
This paper concerns a number of diagram categories, namely the partition, planar partition, Brauer, partial Brauer, Motzkin and Temperley-Lieb categories. If $\mathcal K$ denotes any of these categories, and if $σ\in\mathcal K_{nm}$ is a fixed morphism, then an associative operation $\star_σ$ may be defined on $\mathcal K_{mn}$ by $α\star_σβ=ασβ$. The resulting semigroup $\mathcal K_{mn}^σ=(\mathcal K_{mn},\star_σ)$ is called a sandwich semigroup. We conduct a thorough investigation of these sandwich semigroups, with an emphasis on structural and combinatorial properties such as Green's relati…
We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value S(9). We also give a related algorithm for the enumeration up to isomorphism of the finite inverse semigroups S with a given underlying semilattice of idempotents E, a given restriction of Green's D-relation on S to E, and a given list of maximal subgroups of S associated to the elements of E.
Let $\mathcal M_{mn}=\mathcal M_{mn}(\mathbb F)$ denote the set of all $m\times n$ matrices over a field $\mathbb F$, and fix some $n\times m$ matrix $A\in\mathcal M_{nm}$. An associative operation $\star$ may be defined on $\mathcal M_{mn}$ by $X\star Y=XAY$ for all $X,Y\in\mathcal M_{mn}$, and the resulting \emph{sandwich semigroup} is denoted $\mathcal M_{mn}^A=\mathcal M_{mn}^A(\mathbb F)$. These semigroups are closely related to Munn rings, which are fundamental tools in the representation theory of finite semigroups. In this article, we study $\mathcal M_{mn}^A$ as well as its subsemigro…
For $n \in \mathbb{N}$, let $X_n = \{a_1, a_2, \ldots, a_n\}$ be an $n$ - element set and let $\textbf{F} = (X_n; <_f)$ be a fence, also called a zigzag poset. As usual, we denote by $I_n$ the symmetric inverse semigroup on $X_n$. We say that a transformation $α\in I_n$ is \textit{fence-preserving} if $x <_f y$ implies that $xα<_f yα$, for all $x, y$ in the domain of $α$. In this paper, we study the semigroup $PFI_n$ of all partial fence-preserving injections of $X_n$ and its subsemigroup $IF_n = \{α\in PFI_n : α^{-1}\in PFI_n\}$. Clearly, $IF_n$ is an inverse semigroup and contains all regula…
We study the algebraic properties of binary relations whose underlying digraph is smooth, that is has no source or sink. Such objects have been studied as surjective hyper-operations (shops) on the corresponding vertex set, and as binary relations that are defined everywhere and whose inverse is also defined everywhere. In the latter formulation, they have been called multipermutations. We study the lattice structure of sets (monoids) of multipermutations over an n-element domain. Through a Galois connection, these monoids form the algebraic counterparts to sets of relations closed under defin…
Fix sets $X$ and $Y$, and write $\mathcal{PT}_{XY}$ for the set of all partial functions $X\to Y$. Fix a partial function $a:Y\to X$, and define the operation $\star_a$ on $\mathcal{PT}_{XY}$ by $f\star_ag=fag$ for $f,g\in\mathcal{PT}_{XY}$. The sandwich semigroup $(\mathcal{PT}_{XY},\star_a)$ is denoted $\mathcal{PT}_{XY}^a$. We apply general results from Part I to thoroughly describe the structural and combinatorial properties of $\mathcal{PT}_{XY}^a$, as well as its regular and idempotent-generated subsemigroups, Reg$(\mathcal{PT}_{XY}^a)$ and $\mathbb E(\mathcal{PT}_{XY}^a)$. After describ…
The primary contribution of this thesis is to introduce and examine the planar modular partition monoid for parameters $m, k \in \mathbb{Z}_{>0}$, which has simultaneously and independently generated interest from other researchers as outlined within. Our collective understanding of related monoids, in particular the Jones, Brauer and partition monoids, along with the algebras they generate, has heavily influenced the direction of research by a significant number of mathematicians and physicists. Examples include Schur-Weyl type dualities in representation theory along with Potts, ice-type and…