Abstract
A mapping from X = {1,2,...,n} to X is orientation-preserving if the sequence (1, 2,...,n ) is a cyclic permutation of a nondecreasing sequence (with respect to some total order on X). Orientation-preserving mappings,can be thought of as preserving a circular order on X. Two partitions of X have the same type if they have identical sizes and numbers of classes. Let be a partition with r classes, and let S be the semigroup generated by the set of orientation-preserving mappings from X to X with kernels of same type as,. We show that the minimum,cardinality of a generating set for S is `, = s), and show that the minimum,number,of idempotent elements required to generate S is ` n r ´ . Keywords: circular order, orientation-preserving mapping, minimum cardinality gen- erating sets, minimum cardinality idempotent generating sets.

This publication has 15 references indexed in Scilit: