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 X be any set and P(X) the set of all partial transformations defined on X, that is, all functions α:A→B where A,B are subsets of X. Then P(X) is a semigroup under composition. Let Y be a subset of X. Recently, Fernandes and Sanwong defined PT(X,Y )={α∈P(X):Xα⊆Y } and defined I(X,Y ) to be the set of all injective transformations in PT(X,Y ) . Hence PT(X,Y ) and I(X,Y ) are subsemigroups of P(X) . In this paper, we study properties of the so-called natural partial order ≤ on PT(X,Y ) and I(X,Y ) in terms of domains, images and kernels, compare ≤ with the subset order, characterise the meet and join of these two orders, then find elements of PT(X,Y ) and I(X,Y ) which are compatible. Also, the minimal and maximal elements are described.

The partition monoid is a salient natural example of a *-regular semigroup. We find a Galois connection between elements of the partition monoid and binary relations, and use it to show that the partition monoid contains copies of the semigroup of transformations and the symmetric and dual-symmetric inverse semigroups on the underlying set. We characterize the divisibility preorders and the natural order on the (straight) partition monoid, using certain graphical structures associated with each element. This gives a simpler characterization of Green’s relations. We also derive a new interpretation of the natural order on the transformation semigroup. The results are also used to describe the ideal lattices of the straight and twisted partition monoids and the Brauer monoid.

Let 𝒯X be the full transformation semigroup on a set X and E be a nontrivial equivalence on X. Write then TE(X) is a subsemigroup of 𝒯X. In this paper, we endow TE(X) with the so-called natural order and determine when two elements of TE(X) are related under this order, then find out elements of TE(X) which are compatible with ≤ on TE(X). Also, the maximal and minimal elements and the covering elements are described.