Vítor Hugo Fernandes

In this paper we characterize the monoids of endomorphisms of the semigroups PO_n and POI_n of all order-preserving partial transformations and of all order-preserving partial permutations, respectively, of a finite n-chain.

In this paper we give presentations for the monoid $\DP_n$ of all partial isometries on $\{1,\ldots,n\}$ and for its submonoid $\ODP_n$ of all order-preserving partial isometries.

In this paper we consider endomorphisms of a finite directed path from monoid generators perspective. Our main aim is to determine the rank of the monoid wEndP_n of all weak endomorphisms of a directed path with n vertices, which is a submonoid of the widely studied monoid O_n of all order-preserving transformations of a n-chain. Also, we describe the regular elements of wEndP_n and calculate its size and number of idempotents.

In this paper we introduce the notion of an orientation-preserving transformation on an arbitrary chain, as
a natural extension for infinite chains of the well known concept for finite chains introduced in 1998 by McAlister and, independently, in 1999 by Catarino and Higgins.
We consider the monoid POP(X) of all orientation-preserving partial transformations on a finite or infinite chain X and its submonoids OP(X) and POPI(X) of all orientation-preserving full transformations and of all orientation-preserving partial permutations on X, respectively.
The monoid PO(X) of all order-preserving partial transformations on X and its injective counterpart POI(X) are also considered.
We study the regularity and give descriptions of the Green's relations of the monoids POP(X), PO(X), OP(X), POPI(X) and POI(X).

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.

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.

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.

In this short note we construct an extension of the Vagner-Preston representation for block-groups and show that its kernel is the largest congruence that separates regular elements.

A zig-zag (or fence) order is a special partial order on a (finite) set. In this paper, we consider the semigroup $TF_{n}$ of all
order-preserving transformations on an $n$-element zig-zag ordered set. We determine the rank of $TF_{n}$ and provide a minimal generating set for $TF_{n}$. Moreover, a formula for the number of idempotents in $TF_{n}$ is given.