Enumeration of order preserving maps
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Three results are obtained concerning the number of order preserving maps of an n-element partially ordered set to itself. We show that any such ordered set has at least 2 2n/3 order preserving maps (and 2 2 in the case of length one). Precise asymptotic estimates for the numbers of self-maps of crowns and fences are also obtained. In addition, lower bounds for many other infinite families are found and several precise problems are formulated.
- G. Birkhoff (1967) Lattice Theory (3rd ed), AMS, Providence.
- R. Canfield and Richard Duke (1991) private communication.
- J. Currie and T. Visentin (1991) The number of order preserving maps of fences and crowns, Order 8, 133–142.
- W. Hoefding (1963). Probability inequalities for sums of bounded random variables, J. Amer. Stat. Ass. 58, 13–30.
- W.-P. Liu, I. Rival, and N. Zaguia (1991) Automorphisms, isotone self-maps and cycle-free orders, preprint.
- I. Rival and A. Rutkowski (1990) Does almost every isotone self-map have a fixed point? preprint.
- D. G. Robinson (1991) Fence endomorphisms and lattice paths with diagonal steps, preprint.
- J. Spencer (1987) Ten Lectures on the Probabilistic Method, SIAM, Philadelphia.
- R. G. Stanton and D. D. Cowan (1970) Note on a “square” functional equation. SIAM Review 12, 277–279.
- W. T. Trotter (1989) private communication.
- Enumeration of order preserving maps
Volume 9, Issue 1 , pp 15-29
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- (Partially) ordered set
- order preserving map
- stochastic process
- Industry Sectors