Idempotent depth in semigroups of order-preserving mappings
Peter M. Higgins · Proceedings of the Royal Society of Edinburgh Section A Mathematics · 1994
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.