Vítor Hugo Fernandes

In this paper, we consider the inverse submonoids AOR_n of oriented transformations and AOP_n of orientation-preserving transformations of the alternating inverse monoid AI_n on a chain with n elements. We compute the cardinalities, describe the Green's structures and the congruences, and calculate the ranks of AOR_n and AOP_n.

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.

We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral. In this context, we define and study monoids generalizing monoids of order-preserving mappings and monoids of orientation-preserving mappings.

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.

Let $X_n$ be a chain with n elements ($n\in\N$) and let $\OP_n$ be the monoid of all orientation-preserving transformations of $X_n$. In this paper, for any nonempty subset $Y$ of $X_n$, we consider the subsemigroup $\OP_n(Y)$ of $\OP_n$ of all transformations with range contained in $Y$: we describe the largest regular subsemigroup of $\OP_n(Y)$, which actually coincides with its subset of all regular elements, and Green's relations on $\OP_n(Y)$. Also, we determine when two semigroups of the type $\OP_n(Y)$ are isomorphic and calculate their ranks. Moreover, a parallel study is presented for the correspondent subsemigroups of the monoid $\OR_n$ of all either orientation-preserving or orientation-reversing transformations of $X_n$.

In this paper we consider the monoid DPC_n of all partial isometries of a n-cycle graph C_n. We show that DPC_n is the submonoid of the monoid of all oriented partial permutations on a n-chain whose elements are precisely all restrictions of a dihedral group of order 2n. Our main aim is to exhibit a presentation of DPC_n. We also describe Green's relations of DPC_n and calculate its cardinality and rank.