Vítor Hugo Fernandes

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

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.

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 study the cyclic inverse monoid CI_n on a set Ω_n with n elements, i.e. the inverse submonoid of the symmetric inverse monoid on Ω_n consisting of all restrictions of the elements of a cyclic subgroup of order n acting cyclically on Ω_n. We show that CI_n has rank 2 (for n⩾2) and n⋅2^n−n+1 elements. Moreover, we give presentations of CI_n on n+1 generators and (n^2+3n+4)/2 relations and on 2 generators and (n^2−n+6)/2 relations. We also consider the remarkable inverse submonoid OCI_n of CI_n constituted by all its order-preserving transformations. We show that OCI_n has rank n and 3⋅2^n−2n−1 elements. Furthermore, we exhibit presentations of OCI_n on n+2 generators and (n^2+3n+8)/2 relations and on n generators and (n^2+3n)/2 relations.

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.

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

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 consider three notable submonoids of the dihedral inverse monoid DI_n, namely its submonoids OPDI_n, MDI_n and ODI_n of all orientation-preserving, monotone and order-preserving transformations, respectively. For each of these three monoids, we compute the cardinal, give descriptions of Green's relations and determine the rank.

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 study partial automorphisms and, more generally, injective partial endomorphisms of a finite undirected path from Semigroup Theory perspective. Our main objective is to give formulas for the ranks of the monoids IEnd(P_n) and PAut(P_n) of all injective partial endomorphisms and of all partial automorphisms of the undirected path P_n with n vertices. We also describe Green's relations of PAut(P_n) and IEnd(P_n) and calculate their cardinals.

The objective of this paper is to study the monoid of all partial
transformations of a finite set that preserve a uniform partition. In addition
to proving that this monoid is a quotient of a wreath product with respect to a
congruence relation, we show that it is generated by 5 generators, we compute
its order and determine a presentation on a minimal generating set.

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 the submonoids OPDI_n, MDI_n and ODI_n of the dihedral inverse monoid DI_n of all orientation-preserving, monotone and order-preserving transformations, respectively. Our goal is to exhibit presentations for each of these three monoids.

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.

In this paper we compute the rank and exhibit a presentation for the monoids
of all $P$-stable and $P$-order preserving partial permutations on a finite set
$\Omega$, with $P$ an ordered uniform partition of $\Omega$. These (inverse)
semigroups constitute a natural class of generators of the pseudovariety of
inverse semigroups ${\sf NO}$ of all normally ordered (finite) inverse
semigroups.

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 study the widely considered endomorphisms and weak endomorphisms of a finite undirected path from monoid generators perspective. Our main aim is to determine the ranks of the monoids $wEnd P_n$ and $End P_n$ of all weak endomorphisms and all endomorphisms of the undirected path $P_n$ with $n$ vertices. We also consider strong and strong weak endomorphisms of $P_n$.