Vítor Hugo Fernandes

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.

Summary: In this paper we consider the monoid $\mathcal {OR}_{n}$ of all full transformations on a chain with $n$ elements that preserve or reverse the orientation, as well as its submonoids $\mathcal {OD}_{n}$ of all order-preserving or order-reversing elements, $\mathcal {OP}_{n}$ of all orientation-preserving elements and $\mathcal {O}_{n}$ of all order-preserving elements. By making use of some well known presentations, we show that each of these four monoids is a quotient of a bilateral semidirect product of two of its remarkable submonoids.

The notion of the Abelian kernel of a finite monoid is a generalization of that of the derived subgroup of a finite group. A monoid $M$ is then called solvable if its chain of Abelian kernels terminates with the submonoid of $M$ generated by its idempotents. The main result of this paper is that the finite idempotent commuting monoids bearing this property are precisely those whose subgroups are solvable. In particular any finite aperiodic monoid is Abelian-solvable in this sense. A generalization of the main result of this paper has been published [in Int. J. Algebra Comput. 14, No. 5-6, 655-665 (2004; Zbl 1081.20067)] by the authors and ıt S. Margolis and ıt B. Steinberg.