Results 11 to 20 of about 410 (263)

Boolean Lifting Properties for Bounded Distributive Lattices [PDF]

Scientific Annals of Computer Science, 2015
In this paper, we introduce the lifting properties for the Boolean elements of bounded distributive lattices with respect to the congruences, filters and ideals, we establish how they relate to each other and to significant algebraic properties, and we ...
D. Cheptea, G. Georgescu, C. Mureșan
doaj   +1 more source

Rough Approximation Operators on a Complete Orthomodular Lattice

Axioms, 2021
This paper studies rough approximation via join and meet on a complete orthomodular lattice. Different from Boolean algebra, the distributive law of join over meet does not hold in orthomodular lattices. Some properties of rough approximation rely on the
Songsong Dai
doaj   +1 more source

Characterization of Lattices Induced by (extended) Chip Firing Games [PDF]

Discrete Mathematics & Theoretical Computer Science, 2001
The Chip Firing Game (CFG) is a discrete dynamical model used in physics, computer science and economics. It is known that the set of configurationsreachable from an initial configuration (this set is called the \textitconfiguration space) can be ordered
Clémence Magnien, Ha Duong Phan, Laurent Vuillon   +2 more
doaj   +1 more source

Rough sets based on fuzzy ideals in distributive lattices

Open Mathematics, 2020
In this paper, we present a rough set model based on fuzzy ideals of distributive lattices. In fact, we consider a distributive lattice as a universal set and we apply the concept of a fuzzy ideal for definitions of the lower and upper approximations in ...
Yang Yongwei, Zhu Kuanyun, Xin Xiaolong
doaj   +1 more source

Stone Commutator Lattices and Baer Rings

Discussiones Mathematicae - General Algebra and Applications, 2022
In this paper, we transfer Davey‘s characterization for κ -Stone bounded distributive lattices to lattices with certain kinds of quotients, in particular to commutator lattices with certain properties, and obtain related results on prime, radical ...
Mureşan Claudia
doaj   +1 more source

Distributive lattices with strong endomorphism kernel property as direct sums [PDF]

Categories and General Algebraic Structures with Applications, 2020
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem  2.8}). We shall determine the structure of special elements (
Jaroslav Gurican
doaj   +1 more source

Distributivity in Lattices

Duke Mathematical Journal, 1952
A lattice L is infinitely (join) distributive if a ∩ ∪ B b = ∪ B (a ∩ b) whenever the indicated joins exist in L. Clearly infinite distributivity implies ordinary distributivity. On the other hand it is easy to give examples of distributive lattices which are not infinitely distributive. For example, the rational integers under the relation of division
Dilworth, R. P., McLaughlin, J. E.
openaire   +3 more sources

On Quasi-P-Almost Distributive Lattices

Discussiones Mathematicae - General Algebra and Applications, 2020
In this paper, the concept of quasi pseudo-complementation on an Almost Distributive Lattice (ADL) as a generalization of pseudo-complementation on an ADL is introduced and its properties are studied.
Bandaru Ravi Kumar, Rao G.C.
doaj   +1 more source

Distribution of Lattice Points [PDF]

Computing, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

K-FILTERS OF DISTRIBUTIVE LATTICES [PDF]

Journal of Algebraic Systems
The concept of K-filters is introduced in distributive lattices and studied some properties of these classes of filters. Some necessary and sufficient conditions are derived for every π-filter of a distributive lattice to become a K-filter.
Mukkamala Sambasiva Rao
doaj   +1 more source