Abstract
We introduce algorithms for calculating minimum length factorisations of order-preserving mappings on a finite chain into products of idempotents, and into products of idempotents of defect one. The least upper bounds for these lengths are given.
Publisher
Cambridge University Press (CUP)
Reference12 articles.
1. Products of idempotent order-preserving transformations of arbitrary chains
2. Products of Idempotent Order-Preserving Transformations
3. Products of idempotents in certain semigroups of transformations;Howie;Proc. R. Soc. Edinburgh Sect. A,1971
4. The Subsemigroup Generated By the Idempotents of a Full Transformation Semigroup
5. 4 Higgins P. M. . On a conjecture of Pin. University of Essex Mathematics Dept. Report No. 92–13.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献