Vítor Hugo Fernandes

In this note we consider the monoid $PODI_n$ of all monotone partial permutations on $\{1,\ldots,n\}$ and its submonoids $DP_n$, $POI_n$ and $ODP_n$ of all partial isometries, of all order-preserving partial permutations and of all order-preserving partial isometries, respectively. We prove that both the monoids $POI_n$ and $ODP_n$ are quotients of bilateral semidirect products of two of their remarkable submonoids, namely of extensive and of co-extensive transformations. Moreover, we show that $PODI_n$ is a quotient of a semidirect product of $POI_n$ and the group $\mathcal{C}_2$ of order two and, analogously, $DP_n$ is a quotient of a semidirect product of $ODP_n$ and $\mathcal{C}_2$.

Let $X$ be a finite or infinite chain and let $\O(X)$ be the monoid of all endomorphisms of $X$.
In this paper, we describe the largest regular subsemigroup of $\O(X)$ and Green's relations on $\O(X)$.
In fact, more generally, if $Y$ is a nonempty subset of $X$ and $\O(X,Y)$ is the subsemigroup of $\O(X)$ of all elements with range contained in $Y$,
we characterize the largest regular subsemigroup of $\O(X,Y)$ and Green's relations on $\O(X,Y)$.
Moreover, for finite chains, we determine when two semigroups of the type $\O(X,Y)$ are isomorphic and calculate their ranks.

In this paper, we consider the monoid DPW_n of all partial isometries of a wheel graph W_n with n+1 vertices. Our main objective is to determine the rank of DPW_n. In the process, we also compute the ranks of three notable subsemigroups of DPW_n. We also describe Green's relations of DPW_n and of its three considered subsemigroups.

Following the new description of an oriented full transformation on a finite chain given recently by Higgins and Vernitsk,
in this short note we present a refinement of this description which is extendable to partial transformations and to injective partial transformations.

Summary: We consider various classes of monoids of transformations on a finite chain, in particular of transformations that preserve or reverse either the order or the orientation. Being finite monoids we are naturally interested in computing both their cardinals and their idempotent numbers. Fibonacci and Lucas numbers play an essential role in the last computations.