• Bulletin of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.81-105
• /
• 2018

In this paper we give two characterisations of the class of reflexive graphs admitting distributive lattice polymorphisms and use these characterisations to address the problem of recognition: we find a polynomial time algorithm to decide if a given reflexive graph G, in which no two vertices have the same neighbourhood, admits a distributive lattice polymorphism.

• Journal of applied mathematics & informatics
• /
• v.37 no.5_6
• /
• pp.383-397
• /
• 2019

In this paper, we introduce ${\delta}$-fuzzy ideals in a pseudo complemented distributive lattice in terms of fuzzy filters. It is proved that the set of all ${\delta}$-fuzzy ideals forms a complete distributive lattice. The set of equivalent conditions are given for the class of all ${\delta}$-fuzzy ideals to be a sub-lattice of the fuzzy ideals of L. Moreover, ${\delta}$-fuzzy ideals are characterized in terms of fuzzy congruences.

• Korean Journal of Mathematics
• /
• v.27 no.2
• /
• pp.425-435
• /
• 2019

The notion of multiplier for an almost distributive lattice is introduced, and some related properties are investigated. Moreover, we introduce a congruence relation ${\phi}_{\alpha}$ induced by ${\alpha}{\in}L$ on an almost distributive lattice and derive some useful properties of ${\phi}_{\alpha}$.

• Korean Journal of Mathematics
• /
• v.24 no.3
• /
• pp.525-535
• /
• 2016

We define a fuzzy lattice as a fuzzy relation, prove the distributive inequalities and the modular inequality of fuzzy lattices, and show that the fuzzy totally ordered set is a distributive fuzzy lattice and that the distributive fuzzy lattice is modular.

• East Asian mathematical journal
• /
• v.19 no.1
• /
• pp.41-48
• /
• 2003

There are many conditions or identities for a lattice to be distributive. In this paper, we study some identities on algebras of type (2,2) and find another set of identities defining distributive lattices. We also study certain identities which define algebras of type (2,2) whose subalgebras generated by two elements are all distributive lattices with at most 4 elements.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.465-486
• /
• 2005

We study the relationship between intuitionistic fuzzy ideals and intuitionistic fuzzy congruences on a distributive lattice. And we prove that the lattice of intuitionistic fuzzy ideals is isomorphic to the lattice of intuitionistic fuzzy congruences on a generalized Boolean algebra.

• Kyungpook Mathematical Journal
• /
• v.60 no.1
• /
• pp.1-20
• /
• 2020

A simple but elegant result of Rival states that every sublattice L of a finite distributive lattice 𝒫 can be constructed from 𝒫 by removing a particular family 𝒥_L of its irreducible intervals. Applying this in the case that 𝒫 is a product of a finite set 𝒞 of chains, we get a one-to-one correspondence L ↦ 𝒟_𝒫(L) between the sublattices of 𝒫 and the preorders spanned by a canonical sublattice 𝒞^⋄ of 𝒫. We then show that L is a tight sublattice of the product of chains 𝒫 if and only if 𝒟_𝒫(L) is asymmetric. This yields a one-to-one correspondence between the tight sublattices of 𝒫 and the posets spanned by its poset J(𝒫) of non-zero join-irreducible elements. With this we recover and extend, among other classical results, the correspondence derived from results of Birkhoff and Dilworth, between the tight embeddings of a finite distributive lattice L into products of chains, and the chain decompositions of its poset J(L) of non-zero join-irreducible elements.

• Korean Journal of Mathematics
• /
• v.28 no.4
• /
• pp.775-789
• /
• 2020

In this paper the concept of e-fuzzy filters is introduced in a Stone Almost Distributive Lattice. Several properties are derived on e-fuzzy filters with the help of maximal fuzzy filters. It is proved that the set of all e-fuzzy filters forms a complete distributive lattice.

• Kyungpook Mathematical Journal
• /
• v.47 no.2
• /
• pp.227-237
• /
• 2007

We define weak distributive $n$-semilattices and $n$-lattices, using variants of the absorption law and those of the distributive law. From a weak distributive $n$-semilattice, we construct direct system of subalgebras which are weak distributive $n$-lattices and show that its direct limit is a reflection of the category $wDn$-SLatt of the weak distributive $n$-semilattices.

• Journal of applied mathematics & informatics
• /
• v.37 no.5_6
• /
• pp.469-480
• /
• 2019

A generalized tiling is defined as a generalization of the properties of tiling a region of ${\mathbb{Z}}^2$ with dominoes, and comprises tiling with rhombus and any other tilings that admits height functions which can be ordered into a distributive lattice. By using properties of the distributive lattice, we prove that the Markov chain consisting of moving from one height function to the next by a flip is fast mixing and the mixing time ${\tau}({\epsilon})$ is given by ${\tau}({\epsilon}){\leq}(kmn)^3(mn\;{\ln}\;k+{\ln}\;{\epsilon}^{-1})$, where mn is the area of the grid ${\Gamma}$ that is a k-regular polycell. This result generalizes the result of the authors (T-tetromino tiling Markov chain is fast mixing, Theor. Comp. Sci. (2018)) and improves on the mixing time obtained by using coupling arguments by N. Destainville and by M. Luby, D. Randall, A. Sinclair.