Advertisement

Ordered Sets pp 297-332 | Cite as

Sets PQ = Hom(Q, P) and Products

  • Bernd Schröder
Chapter
  • 1.1k Downloads

Abstract

The order-preserving maps from one ordered set to another form a natural ordered set when given the pointwise order. Products are defined similar to these homomorphism sets. Hence we will investigate homomorphism sets and products of ordered sets in the same chapter. We will introduce some of the salient results on these sets, such as the fixed point theorem for products of two finite ordered sets (see Theorem 12.17), Hashimoto’s Refinement Theorem (see Theorem 12.30), and the cancelation property for exponents (see Theorem 12.47). The automorphism conjecture (see Open Question 2.14) as well as the open problems at the end of this chapter show that there are interesting problems related to homomorphism sets and products that remain open.

Keywords

Boolean Algebra Point Property Finite Product Infinite Product Fixed Point Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 12.
    Baclawski, K., & Björner, A. (1979). Fixed points in partially ordered sets. Advances in Mathematics, 31, 263–287.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 16.
    Bélanger, M. F., Constantin, J., & Fournier, G. (1994). Graphes et ordonnés démontables, propriété de la clique fixe. Discrete Mathematics, 130, 9–17.MathSciNetCrossRefGoogle Scholar
  3. 18.
    Bergman, C., McKenzie, R., & Nagy, Sz. (1982). How to cancel a linearly ordered exponent. Colloquia Mathematica Societatis János Bolyai, 21, 87–94.MathSciNetzbMATHGoogle Scholar
  4. 21.
    Birkhoff, G. (1967). Lattice theory (3rd ed.). Providence: AMS Colloquium Publications XXV.zbMATHGoogle Scholar
  5. 38.
    Brown, R. (1982). The fixed point property and Cartesian products. The American Mathematical Monthly, November issue, 654–678.Google Scholar
  6. 43.
    Chang, C., Jonsson, B., & Tarski, A. (1964). Refinement properties for relational structures. Fundamenta Mathematicae, 55, 249–281.MathSciNetzbMATHGoogle Scholar
  7. 50.
    Corominas, E. (1990). Sur les ensembles ordonnés projectifs et la propriété du point fixe. Comptes Rendus de l’Académie des Sciences Paris Série I, 311, 199–204.MathSciNetzbMATHGoogle Scholar
  8. 51.
    Cousot, P., & Cousot, R. (1979). Constructive versions of Tarski’s fixed point theorems. Pacific Journal of Mathematics, 82, 43–57.MathSciNetCrossRefzbMATHGoogle Scholar
  9. 52.
    Cousot, P., & Cousot, R. (1979). A constructive characterization of the lattices of all retractions, preclosure, quasi-closure and closure operators on a complete lattice. Portugaliae Mathematica, 38, 185–198.MathSciNetzbMATHGoogle Scholar
  10. 53.
    Crapo, H. H. (1982). Ordered sets: Retracts and connections. Journal of Pure and Applied Algebra, 23, 13–28.MathSciNetCrossRefzbMATHGoogle Scholar
  11. 56.
    Davey, B., & Priestley, H. (1990). Introduction to lattices and order. Cambridge: Cambridge University Press.zbMATHGoogle Scholar
  12. 63.
    Dilworth, R. P. (1950). A decomposition theorem for partially ordered sets. Annals of Mathematics, 51, 161–166.MathSciNetCrossRefzbMATHGoogle Scholar
  13. 67.
    Duffus, D. (1984). Automorphisms and products of ordered sets. Algebra Universalis, 19, 366–369.MathSciNetCrossRefzbMATHGoogle Scholar
  14. 72.
    Duffus, D., & Rival, I. (1978). A logarithmic property for exponents of partially ordered sets. Canadian Journal of Mathematics, 30, 797–807.MathSciNetCrossRefzbMATHGoogle Scholar
  15. 73.
    Duffus, D., & Rival, I. (1981) A structure theory for ordered sets. Discrete Mathematics, 35, 53–118.MathSciNetCrossRefzbMATHGoogle Scholar
  16. 77.
    Duffus, D., & Sauer, N. (1987). Fixed points of products and the strong fixed point property. Order, 4, 221–231.MathSciNetCrossRefzbMATHGoogle Scholar
  17. 115.
    Habib, M., Morvan, M., Pouzet, M., & Rampon, J.-X. (1993). Interval dimension and MacNeille completion. Order, 10, 147–151.MathSciNetCrossRefzbMATHGoogle Scholar
  18. 121.
    Hashimoto, J. (1948). On the product decomposition of partially ordered sets. Mathematica Japonica, 1, 120–123.MathSciNetzbMATHGoogle Scholar
  19. 122.
    Hashimoto, J. (1951). On direct product decomposition of partially ordered sets. Annals of Mathematics, 54(2), 315–318.MathSciNetCrossRefzbMATHGoogle Scholar
  20. 123.
    Hashimoto, J., & Nakayama, T. (1950). On a problem of G. Birkhoff. Proceedings of the American Mathematical Society, 1, 141–142.Google Scholar
  21. 125.
    Hazan, S. (1992). The Projection Property for Orders and Triangle-Free Graphs. Ph.D. dissertation, Vanderbilt University.Google Scholar
  22. 126.
    Hazan, S. (1996). On triangle-free projective graphs. Algebra Universalis, 35(2), 185–196.MathSciNetCrossRefzbMATHGoogle Scholar
  23. 128.
    Hazan, S., & Neumann-Lara, V. (1998). Two order invariants related to the fixed point property. Order, 15, 97–111.MathSciNetCrossRefzbMATHGoogle Scholar
  24. 150.
    Jónsson, B. (1982). Arithmetic of ordered sets. In I. Rival (Ed.), Ordered sets (pp. 3–41). Dordrecht: D. Reidel.CrossRefGoogle Scholar
  25. 151.
    Jónsson, B., & McKenzie, R. (1982). Powers of partially ordered sets: Cancellation and refinement properties. Mathematica Scandinavica, 51, 87–120.MathSciNetzbMATHGoogle Scholar
  26. 155.
    Kelly, D., & Trotter, W. T. (1982). Dimension theory for ordered sets. In I. Rival (Ed.), Ordered sets (pp. 171–211). Dordrecht: D. Reidel.CrossRefGoogle Scholar
  27. 176.
    Kukieła, M., & Schröder, B. (2012). A 2-antichain that is not contained in any finite retract. Algebra Universalis, 67, 59–62.MathSciNetCrossRefzbMATHGoogle Scholar
  28. 180.
    Larose, B. (1995). Minimal automorphic posets and the projection property. International Journal of Algebra and Computation, 5, 65–80.MathSciNetCrossRefzbMATHGoogle Scholar
  29. 183.
    Li, B. (1990). All retraction operators on a lattice need not form a lattice. Journal of Pure and Applied Algebra, 67, 201–208.MathSciNetCrossRefzbMATHGoogle Scholar
  30. 194.
    Lovász, L. (1967). Operations with structures. Acta Mathematica Hungarica, 18, 321–328.MathSciNetCrossRefzbMATHGoogle Scholar
  31. 195.
    Lovász, L. (1971). On the cancellation law among finite relational structures. Periodica Mathematica Hungarica, 1, 145–156.MathSciNetCrossRefzbMATHGoogle Scholar
  32. 206.
    McKenzie, R. (2000). Arithmetic of finite ordered sets: Cancellation of exponents II. Order, 17, 309–332.MathSciNetCrossRefzbMATHGoogle Scholar
  33. 207.
    Milner, E. C. (1990). Dilworth’s decomposition theorem in the infinite case. In K. P. Bogart, R. Freese, & J. P. S. Kung (Eds.), The Dilworth theorems: Selected papers of Robert P. Dilworth (pp. 30–35). Boston: Birkhäuser.CrossRefGoogle Scholar
  34. 217.
    Nowakowski, R. (1981). Open question on p. 842 of [246].Google Scholar
  35. 220.
    Peles, M. A. (1963). On Dilworth’s theorem in the infinite case. Israel Journal of Mathematics, 1, 108–109.MathSciNetCrossRefGoogle Scholar
  36. 221.
    Pickering, D., & Roddy, M. (1992). On the strong fixed point property. Order, 9, 305–310.MathSciNetCrossRefzbMATHGoogle Scholar
  37. 255.
    Roddy, M. (1994). Fixed points and products. Order, 11, 11–14.MathSciNetCrossRefzbMATHGoogle Scholar
  38. 256.
    Roddy, M. (2002). Fixed points and products: Width 3. Order, 19, 319–326.MathSciNetCrossRefzbMATHGoogle Scholar
  39. 257.
    Roddy, M. (2002). On an example of Rutkowski and Schröder. Order, 19, 365–366.MathSciNetCrossRefzbMATHGoogle Scholar
  40. 258.
    Roddy, M., & Schröder, B. (2005). Isotone relations revisited. Discrete Mathematics, 290, 229–248.MathSciNetCrossRefzbMATHGoogle Scholar
  41. 281.
    Schröder, B. (2006). Examples of powers of ordered sets with the fixed point property. Order, 23, 211–219.MathSciNetCrossRefzbMATHGoogle Scholar
  42. 287.
    Schröder, B. (2015). The fixed vertex property for graphs. Order, 32, 363–377.MathSciNetCrossRefzbMATHGoogle Scholar
  43. 301.
    Stong, R. E. (1966). Finite topological spaces. Transactions of the American Mathematical Society, 123, 325–340.MathSciNetCrossRefzbMATHGoogle Scholar
  44. 311.
    Trotter, W. T. (1992). Combinatorics and partially ordered sets: Dimension theory. Baltimore: Johns Hopkins University Press.zbMATHGoogle Scholar
  45. 318.
    Walker, J. W. (1984). Isotone relations and the fixed point property for posets. Discrete Mathematics, 48, 275–288.MathSciNetCrossRefzbMATHGoogle Scholar
  46. 320.
    West, D. (1996). Introduction to graph theory. Upper Saddle River: Prentice Hall.zbMATHGoogle Scholar
  47. 325.
    Willard, S. (1970). General topology. Reading: Addison-Wesley.zbMATHGoogle Scholar
  48. 330.
    Zádori, L. (1992). Order varieties generated by finite posets. Order, 8, 341–348.MathSciNetCrossRefzbMATHGoogle Scholar
  49. 331.
    Zádori, L. (1998). Characterizing finite irreducible relational sets. Acta Scientiarum Mathematicarum (Szeged), 64, 455–462.MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing 2016

Authors and Affiliations

  • Bernd Schröder
    • 1
  1. 1.Department of MathematicsUniversity of Southern MississippiHattiesburgUSA

Personalised recommendations