Vítor Hugo Fernandes

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.