A theorem on partially ordered sets of order-preserving mappings
HTML articles powered by AMS MathViewer
- by Dwight Duffus and Rudolf Wille PDF
- Proc. Amer. Math. Soc. 76 (1979), 14-16 Request permission
Abstract:
Let P be a partially ordered set and let ${P^P}$ denote the set of all order-preserving mappings of P to P ordered by $f \leqslant g$ in ${P^P}$ if $f(p) \leqslant g(p)$ for all $p \in P$. We prove that if P and Q are finite, connected partially ordered sets and ${P^P} \cong {Q^Q}$ then $P \cong Q$.References
- Garrett Birkhoff, An extended arithmetic, Duke Math. J. 3 (1937), no. 2, 311–316. MR 1545989, DOI 10.1215/S0012-7094-37-00323-5 D. Duffus, Toward a theory of finite partially ordered sets, Ph.D. Thesis, University of Calgary, 1978.
- Dwight Duffus and Ivan Rival, A logarithmic property for exponents of partially ordered sets, Canadian J. Math. 30 (1978), no. 4, 797–807. MR 498291, DOI 10.4153/CJM-1978-068-x
- L. M. Gluskĭn, Semi-groups of isotone transformations, Uspehi Mat. Nauk 16 (1961), no. 5, 157–162 (Russian). MR 0131486
- Junji Hashimoto, On direct product decomposition of partially ordered sets, Ann. of Math. (2) 54 (1951), 315–318. MR 43067, DOI 10.2307/1969532
- Rudolf Wille, Cancellation and refinement results for function lattices, Houston J. Math. 6 (1980), no. 3, 431–437. MR 597781
Additional Information
- © Copyright 1979 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 76 (1979), 14-16
- MSC: Primary 06A10
- DOI: https://doi.org/10.1090/S0002-9939-1979-0534380-2
- MathSciNet review: 534380