Vítor Hugo Fernandes

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.

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.

In this paper, we consider the inverse submonoids AM_n of monotone transformations and AO_n of order-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 these two submonoids of AI_n.

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.

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.