Vítor Hugo Fernandes

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

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

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

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.

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 note, we consider the semigroup $O(X)$ of all order endomorphisms of an infinite chain $X$ and the subset $J$ of $O(X)$ of all transformations $\alpha$ such that $|Im(\alpha)|=|X|$. For an infinite countable chain $X$, we give a necessary and sufficient condition on $X$ for $O(X) = < J >$ to hold. We also present a sufficient condition on $X$ for $O(X) = < J >$ to hold, for an arbitrary infinite chain $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_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 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.

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

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.

We introduce a class of finite semigroups obtained by considering Rees
quotients of numerical semigroups.
Several natural questions concerning this class, as well as particular
subclasses obtained by considering some special ideals, are answered while
others remain open. We exhibit nice presentations for these semigroups and
prove that the Rees quotients by ideals of N, the positive integers under
addition, constitute a set of generators for the pseudovariety of commutative
and nilpotent semigroups.

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.