We calculate the rank and idempotent rank of the semigroup ${\mathcal{E}}(X,{\mathcal{P}})$ generated by the idempotents of the semigroup ${\mathcal{T}}(X,{\mathcal{P}})$ which consists of all transformations of the finite set $X$ preserving a nonuniform partition ${\mathcal{P}}$. We also classify and enumerate the idempotent generating sets of minimal possible size. This extends results of the first two authors in the uniform case.

In this short note, we describe all the elements in the semigroup

$$\begin{eqnarray}S(X,Y)=\{f\in {\mathcal{T}}_{X}:f(Y)\subseteq Y\}\end{eqnarray}$$

For a semigroup $S$, let ${S}^{1} $ be the semigroup obtained from $S$ by adding a new symbol 1 as its identity if $S$ has no identity; otherwise let ${S}^{1} = S$. Mitsch defined the natural partial order $\leqslant $ on a semigroup $S$ as follows: for $a, b\in S$, $a\leqslant b$ if and only if $a= xb= by$ and $a= ay$ for some $x, y\in {S}^{1} $. In this paper, we characterise the natural partial order on some transformation semigroups. In these partially ordered sets, we determine the compatibility of their elements, and find all minimal and maximal elements.

Let 𝒯X be the full transformation semigroup on the nonempty set X. We fix a nonempty subset Y of X and consider the semigroup of transformations that leave Y invariant, and endow it with the so-called natural partial order. Under this partial order, we determine when two elements of S(X,Y ) are related, find the elements which are compatible and describe the maximal elements, the minimal elements and the greatest lower bound of two elements. Also, we show that the semigroup S(X,Y ) is abundant.

Let Y be a fixed nonempty subset of a set X and let T(X,Y ) denote the semigroup of all total transformations from X into Y. In 1975, Symons described the automorphisms of T(X,Y ). Three decades later, Nenthein, Youngkhong and Kemprasit determined its regular elements, and more recently Sanwong, Singha and Sullivan characterized all maximal and minimal congruences on T(X,Y ). In 2008, Sanwong and Sommanee determined the largest regular subsemigroup of T(X,Y ) when |Y |≠1 and Y ≠ X; and using this, they described the Green’s relations on T(X,Y ) . Here, we use their work to describe the ideal structure of T(X,Y ) . We also correct the proof of the corresponding result for a linear analogue of T(X,Y ) .

The relative rank $\rank(S:A)$ of a subset $A$ of a semigroup $S$ is the minimum cardinality of a set $B$ such that $\langle A\cup B\rangle=S$. It follows from a result of Sierpiński that, if $X$ is infinite, the relative rank of a subset of the full transformation semigroup $\mathcal{T}_{X}$ is either uncountable or at most $2$. A similar result holds for the semigroup $\mathcal{B}_{X}$ of binary relations on $X$.

A subset $S$ of $\mathcal{T}_{\mathbb{N}}$ is dominated (by $U$) if there exists a countable subset $U$ of $\mathcal{T}_{\mathbb{N}}$ with the property that for each $\sigma$ in $S$ there exists $\mu$ in $U$ such that $i\sigma\le i\mu$ for all $i$ in $\mathbb{N}$. It is shown that every dominated subset of $\mathcal{T}_{\mathbb{N}}$ is of uncountable relative rank. As a consequence, the monoid of all contractions in $\mathcal{T}_{\mathbb{N}}$ (mappings $\alpha$ with the property that $|i\alpha-j\alpha|\le|i-j|$ for all $i$ and $j$) is of uncountable relative rank.

It is shown (among other results) that $\rank(\mathcal{B}_{X}:\mathcal{T}_{X})=1$ and that $\rank(\mathcal{B}_{X}:\mathcal{I}_{X})=1$ (where $\mathcal{I}_{X}$ is the symmetric inverse semigroup on $X$). By contrast, if $\mathcal{S}_{X}$ is the symmetric group, $\rank(\mathcal{B}_{X}:\mathcal{S}_{X})=2$.

AMS 2000 Mathematics subject classification: Primary 20M20