Abstract
For a linearly ordered set X we consider the relative rank of the semigroup of all order preserving mappings O-X on X modulo the full transformation semigroup Ex. In other words, we ask what is the smallest cardinality of a set A of mappings such that <O-X boolean OR A> = T-X. When X is countably infinite or well-ordered (of arbitrary cardinality) we show that this number is one, while when X = R (the set of real numbers) it is uncountable.
| Original language | English |
|---|---|
| Pages (from-to) | 557-566 |
| Number of pages | 10 |
| Journal | Glasgow Mathematical Journal |
| Volume | 45 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Sept 2003 |
Keywords
- Ranks
Fingerprint
Dive into the research topics of 'Generating the full transformation semigroup using order preserving mappings'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver