• Title/Summary/Keyword: lattices

Search Result 291, Processing Time 0.033 seconds

FUZZY $\sigma$-IDEALS OF $\sigma$-LATTICES

  • IN BYUNG SIK
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.633-641
    • /
    • 2005
  • We investigate the relationship between fuzzy $\sigma$-ideals and fuzzy congruence on a distributive $\sigma$-lattice and obtain some useful results.

CHARACTERIZATIONS OF COTYPE OF OPERATORS ACTING ON BANACH LATTICES

  • Song, Hi Ja
    • Korean Journal of Mathematics
    • /
    • v.13 no.1
    • /
    • pp.61-82
    • /
    • 2005
  • We characterize Gaussian cotype X operators acting between Banach spaces, where X is a Banach sequence space. Further we give an extensive presentation of results on the connections between cotype and summing operators.

  • PDF

Truncate products of lattices

  • Bae, Deok-Rak;Lee, Jeh-Gwon
    • Journal of the Korean Mathematical Society
    • /
    • v.31 no.4
    • /
    • pp.559-568
    • /
    • 1994
  • A lattice is called bounded if it has both the least element and the largest element which are usually denoted by 0 (zero) and 1(unit), respectively.

  • PDF

ON δ-FRAMES AND STRONG δ-FRAMES

  • Choi, Eun Ai
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.11 no.1
    • /
    • pp.27-34
    • /
    • 1998
  • We introduce ${\delta}$-frames, strong ${\delta}$-frames and completely distributive lattices, and investigate some relationships among those frames.

  • PDF

Updating Algorithms using a Galois-Lattice Structure for Building and Maintaining Object-Oriented Analysis Models (Galois-격자 구조를 이용한 객체지향 분석 모델 구축과 유지에 관한 갱신 알고 리즘)

  • Ahn, Hi-Suck;Jun, Moon-Seog;Rhew, Sung-Yul
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.4
    • /
    • pp.477-486
    • /
    • 1995
  • This paper describes and constructs object-oriented analysis models using Galois-lattices that we are always studying in discrete mathematics, shows fundamental approaches to maintain the models, analyzes the construction of object-oriented analysis models through good examples. Also, we define several properties of Galois-lattices that have binary relations between class objects, propose the incremental updating algorithms that can update the Galois-lattice whenever new classes are added. This proposal shows that in case of adding new class nodes the results from simulations can implement in constant time and have linearly the incremental structures in worst cases, and in that the growth rate of lattices is proportioned to class nodes in time complexity. This results can achieve the high understandability of object-oriented analysis models and the high traceability of maintenance models. Furthermore it is possible to make more efficient performances of class reusability in advantages of object-oriented systems and support truly the class hierarchical maintenances.

  • PDF

A Note on Random Walk and Self-avoiding Walk

  • 전범순;박지현
    • Proceedings of the Korean Society of Computational and Applied Mathematics Conference
    • /
    • 2003.09a
    • /
    • pp.8.1-8
    • /
    • 2003
  • We prove that m-step walks and self-avoiding walks on the 2D triangle lattices can be uniquely characterized (canonized) with no more than m Euclidian distances. We also demonstrate that these canonical distances can be obtained with O(n) physical measurements.

  • PDF

The schur group of a Krull domain

  • Shin, Kyung-Hee;Lee, Hei-Sook
    • Communications of the Korean Mathematical Society
    • /
    • v.10 no.3
    • /
    • pp.527-539
    • /
    • 1995
  • We consider the Schur groups of some module categories, which are subcategories of category of divisorial modules over a Krull domain. Then we obtain the exact sequence connecting class group, Schur class group and Schur groups of these categories.

  • PDF