Abstract
Consider the finite set Xn = {1,2, …,n} ordered in the standard way. Let Tn denote the full transformation semigroup on Xn, that is, the semigroup of all mappings α: Xn→Xn under composition. We shall call α order-preserving if i ≤ j implies iα ≤ jα for i,j∈Xn, and α is decreasing if iα ≤ i for all i∈Xn. This paper investigates combinatorial properties of the semigroup O of all order-preserving mappings on Xn, and of its subsemigroup C which consists of all decreasing and order-preserving mappings.
Publisher
Cambridge University Press (CUP)
Reference14 articles.
1. A note on the number of idempotents in symmetric semigroups;Harris;J. Combin. Theory Ser. A,1967
2. Probability of Indecomposability of a Random Mapping Function
3. Catalan Numbers, Their Generalization, and Their Uses
4. Random functions on a finite set;Higgins;Ars Combin.,1988
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献