DOI QR코드

DOI QR Code

NOTES ON MODULAR ORDERED SETS

  • Published : 2012.02.15

Abstract

Generalizing modular lattices, a concept of modular ordered sets was introduced by Chajda and Rachunek. In this paper, we characterize modular ordered sets as those partially ordered set P satisfying that for $a,\;b,\;c\;{\in}\;P\;with\;b\;{\leq}\;c,\;l(a,\;b)\;=\;l(a,\;c)\;and\;u(a,\;b)\;=\;u(a,\;c)$ imply $b\;=\;c$. Using this, we obtain a sufficient condition for them. We also discuss the modularity of the Dedekind-MacNeille completions of ordered sets.

Keywords

References

  1. G. Birkhoff, Lattice Theory, Ame. Math. Soc. Collq. Publ. Vol. 25, providence, R. L, 1967.
  2. I. Chajda and J. Rachunek, Forbidden Configurations for Distributive and Modular Ordered Sets, Order 5 (1989), 407-423. https://doi.org/10.1007/BF00353659
  3. B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, Cambridge University Press, 1990.
  4. Y. H. Hong, S. J. Lim and S. H. Shin, Modularity and Distributivity of Ordered Sets, J. Nat. Sci. Sookmyung Women's Univ. 13 (2002), 83-87.
  5. M. Kolibiar, Modular Ordered sets, Math. Slovaca, 44 (1994), no. 2, 139-141.