Vítor Hugo Fernandes

In this paper we consider various classes of monoids of transformations of a finite chain,
including those of transformations that preserve or reverse either the order or the orientation.
In line with Howie and McFadden (1990),
we complete the study of the ranks (and of idempotent ranks, when applicable) of all their ideals.

In this paper, we characterize the monoid of endomorphisms of the semigroup of all monotone full transformations of a finite chain, as well as the monoids of endomorphisms of the semigroup of all monotone partial transformations and of the semigroup of all monotone partial permutations of a finite chain.

Let $\Omega_n$ be a finite chain with $n$ elements $(n\in\mathbb{N})$, and let $\mathcal{POPI}_{n}$ be the semigroup of all injective orientation-preserving partial transformations of $\Omega_n$. In this paper, for any nonempty subset $Y$ of $\Omega_n$, we consider the subsemigroup $\mathcal{POPI}_{n}(Y)$ of $\mathcal{POPI}_{n}$ of all transformations with range contained in $Y$. We describe the Green's relations and study the regularity of $\mathcal{POPI}_{n}(Y)$. Moreover, we calculate the rank of $\mathcal{POPI}_{n}(Y)$ and determine when two semigroups of this type are isomorphic.

In this paper, we characterize the monoid of endomorphisms of the semigroup of all oriented full transformations of a finite chain, as well as the monoid of endomorphisms of the semigroup of all oriented partial transformations and the monoid of endomorphisms of the semigroup of all oriented partial permutations of a finite chain. Characterizations of the monoids of endomorphisms of the subsemigroups of all orientation-preserving transformations of the three semigroups aforementioned are also given. In addition, we compute the number of endomorphisms of each of these six semigroups.

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 paper we consider the monoid DPSn of all partial isometries of a star graph Sn with n vertices. Our main objectives are to determine the rank and to exhibit a presentation of DPSn. We also describe Green’s relations of DPSn and calculate its cardinal.

In this paper, we consider the monoids of all endomorphisms, of all weak endomorphisms, of all strong endomorphisms and of all strong weak endomorphisms of a star graph with a finite number of vertices. Our main objective is to exhibit a presentation for each of them.

In this note, we aim to correct some of the results presented in [1]. Namely, the statements of Proposition 2.1, Corollary 2.2, Corollary 2.3, Theorem 2.4 and Theorem 2.6, concerning only the monoids OP_n and POP_n, have to exclude transformations of rank two. All other results of [1], as well as those mentioned above but for the monoids OR_n and POR_n, do not require correction.

[1] V.H. Fernandes, Oriented transformations on a finite chain: another description, Commun. Korean Math. Soc. 38 (2023), 725-731.

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 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$.

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 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.

In this note we give a presentation for the monoid IO_n of all order-preserving transformations of a n-chain whose ranges are intervals. We also consider the submonoid IO_n^- of IO_n consisting of order-decreasing transformations, for which we determine the cardinality, the rank and a presentation.

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).

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.