Results 11 to 20 of about 2,215 (299)
Generalized prime $D$-filters of distributive lattices [PDF]
summary:The concept of generalized prime $D$-filters is introduced in distributive lattices. Generalized prime $D$-filters are characterized in terms of principal filters and ideals.
Phaneendra Kumar, A.P. +2 more
core +4 more sources
SOME PROPERTIES ON DERIVATIONS OF LATTICES [PDF]
In this paper we consider some properties of derivations of lattices and show that (i) for a derivation $d$ of a lattice $L$ with the maximum element $1$, it is monotone if and only if $d(x) \le d(1)$ for all $x\in L$ (ii) a monotone derivation $d$ is ...
Mayuka Kawaguchi, Michiro KONDO
doaj +1 more source
INTRINSIC IDEALS OF DISTRIBUTIVE LATTICES [PDF]
The concepts of intrinsic ideals and inlets are introduced in a distributive lattice. Intrinsic ideals are also characterized with the help of inlets.
SAMBASIVA RAO MUKKAMALA
doaj +1 more source
REGULAR FILTERS OF DISTRIBUTIVE LATTICES [PDF]
The concepts of regular filters and π--filters are introduced in distributive lattices. A set of equivalent conditions is given for a D-filter to become a regular filter.
Sambasiva Rao Mukkamala +1 more
doaj +1 more source
New characterization theorems of the mp-quantales [PDF]
The mp-quantales were introduced in a previous paper as an abstraction of the lattices of ideals in mp-rings and the lattices of ideals in conormal lattices. Several properties of m-rings and conormal lattices were generalized to mp-quantales.
George Georgescu
doaj +1 more source
On the Number of Distributive Lattices [PDF]
We investigate the numbers $d_k$ of all (isomorphism classes of) distributive lattices with $k$ elements, or, equivalently, of (unlabeled) posets with $k$ antichains. Closely related and useful for combinatorial identities and inequalities are the numbers $v_k$ of vertically indecomposable distributive lattices of size $k$.
Marcel Erné +2 more
openaire +2 more sources
Characterization of Lattices Induced by (extended) Chip Firing Games [PDF]
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 +2 more
doaj +1 more source
Rough Approximation Operators on a Complete Orthomodular Lattice
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
Equations for distributive lattices with quantifiers [PDF]
ilustraciones, diagramasEste trabajo aborda el estudio de los Q-retículos distributivos, generalizaciones de las álgebras Booleanas monádicas. Mediante resultados de dualidad basados en el trabajo de Stone, Priestley y Halmos se muestra que las ...
Ramírez Ramos, Nicolás José
core +2 more sources
Stone Commutator Lattices and Baer Rings
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

