scholarly journals On Decompositions of Matrices over Distributive Lattices

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Yizhi Chen ◽  
Xianzhong Zhao
Keyword(s):  
Distributive Lattice ◽  
Direct Product ◽  
Boolean Algebras ◽  
Distributive Lattices ◽  
The Matrix ◽  
Nilpotent Matrices ◽  
Decomposition Theorems ◽  
Finite Distributive Lattices ◽  
Matrix Semigroup

LetLbe a distributive lattice andMn,q(L)(Mn(L), resp.) the semigroup (semiring, resp.) ofn×q(n×n, resp.) matrices overL. In this paper, we show that if there is a subdirect embedding from distributive latticeLto the direct product∏i=1m‍Liof distributive latticesL1,L2, …,Lm, then there will be a corresponding subdirect embedding from the matrix semigroupMn,q(L)(semiringMn(L), resp.) to semigroup∏i=1m‍Mn,q(Li)(semiring∏i=1m‍Mn(Li), resp.). Further, it is proved that a matrix over a distributive lattice can be decomposed into the sum of matrices over some of its special subchains. This generalizes and extends the decomposition theorems of matrices over finite distributive lattices, chain semirings, fuzzy semirings, and so forth. Finally, as some applications, we present a method to calculate the indices and periods of the matrices over a distributive lattice and characterize the structures of idempotent and nilpotent matrices over it. We translate the characterizations of idempotent and nilpotent matrices over a distributive lattice into the corresponding ones of the binary Boolean cases, which also generalize the corresponding structures of idempotent and nilpotent matrices over general Boolean algebras, chain semirings, fuzzy semirings, and so forth.

scholarly journals Congruences on a Distributive Lattice

1954 ◽  
Vol 10 (2) ◽  
pp. 76-77
Author(s):  
H. A. Thueston
Keyword(s):  
Distributive Lattice ◽  
Lattice Theory ◽  
Distributive Lattices ◽  
The Subject ◽  
The Many ◽  
Finite Distributive Lattices

Among the many papers on the subject of lattices I have not seen any simple discussion of the congruences on a distributive lattice. It is the purpose of this note to give such a discussion for lattices with a certain finiteness. Any distributive lattice is isomorphic with a ring of sets (G. Birkhoff, Lattice Theory, revised edition, 1948, p. 140, corollary to Theorem 6); I take the case where the sets are finite. All finite distributive lattices are covered by this case.

scholarly journals On the relation of a distributive lattice to its lattice of ideals

1972 ◽  
Vol 7 (3) ◽  
pp. 377-385 ◽  
Author(s):  
Herbert S. Gaskill
Keyword(s):  
Distributive Lattice ◽  
Related Result ◽  
Distributive Lattices ◽  
Relationship Of ◽  
The Relationship ◽  
Finite Distributive Lattices ◽  
Lattice Of Ideals

In this note we examine the relationship of a distributive lattice to its lattice of ideals. Our main result is that a distributive lattice and its lattice of ideals share exactly the same collection of finite sublattices. In addition we give a related result characterizing those finite distributive lattices L which can be embedded in a lattice L′ whenever they can be embedded in its lattice of ideals T(L′).

Maximal Sublattices of Finite Distributive Lattices. III: A Conjecture from the 1984 Banff Conference on Graphs and Order

2011 ◽  
Vol 54 (2) ◽  
pp. 277-282
Author(s):  
Jonathan David Farley
Keyword(s):  
Distributive Lattice ◽  
Maximal Chain ◽  
Distributive Lattices ◽  
Finite Distributive Lattice ◽  
Finite Distributive Lattices

AbstractLet L be a finite distributive lattice. Let Sub0(L) be the lattice﹛S | S is a sublattice of L﹜ [ ﹛∅﹜ and let ℓ*[Sub0(L)] be the length of the shortest maximal chain in Sub0(L). It is proved that if K and L are non-trivial finite distributive lattices, then ℓ*[Sub0(K × L)] = ℓ*[Sub0(K)] + ℓ[Sub0(L)]. A conjecture from the 1984 Banff Conference on Graphs and Order is thus proved.

Coaxer Lattices

2017 ◽  
Vol 60 (2) ◽  
pp. 372-380
Author(s):  
M. Sambasiva Rao
Keyword(s):  
Distributive Lattice ◽  
Boolean Algebras ◽  
Distributive Lattices ◽  
Maximal Ideals

AbstractThe notion of coaxers is introduced in a pseudo-complemented distributive lattice. Boolean algebras are characterized in terms of coaxer ideals and congruences. The concept of coaxer lattices is introduced in pseudo-complemented distributive lattices and characterized in terms of coaxer ideals and maximal ideals. Finally, the coaxer lattices are also characterized in topological terms.

scholarly journals Covering in the lattice of subuniverses of a finite distributive lattice

1998 ◽  
Vol 65 (3) ◽  
pp. 333-353 ◽  
Author(s):  
Zsolt Lengvárszky ◽  
George F. McNulty
Keyword(s):  
Distributive Lattice ◽  
Distributive Lattices ◽  
Finite Distributive Lattice ◽  
Covering Relation ◽  
Finite Distributive Lattices

AbstractThe covering relation in the lattice of subuniverses of a finite distributive lattices is characterized in terms of how new elements in a covering sublattice fit with the sublattice covered. In general, although the lattice of subuniverses of a finite distributive lattice will not be modular, nevertheless we are able to show that certain instances of Dedekind's Transposition Principle still hold. Weakly independent maps play a key role in our arguments.

scholarly journals Imbedding Infinitely Distributive Lattices Completely Isomorphically Into Boolean Algebras

1959 ◽  
Vol 15 ◽  
pp. 71-81 ◽  
Author(s):  
Nenosuke Funayama
Keyword(s):  
Boolean Algebra ◽  
Distributive Lattice ◽  
Boolean Algebras ◽  
The Other ◽  
Distributive Lattices ◽  
Algebra 1 ◽  
Infinite Distributivity ◽  
Distributive Law ◽  
Finite Sums ◽  
Finite Products

It is well known that any distributive lattice can be imbedded in a Boolean algebra ([1], [2], [4] and others). This imbedding is in general only finitely isomorphic in the sense that the imbedding preserves finite sums (supremums) and finite products (infimums) (but not necessarily infinite ones). Indeed, in order to be able to be imbedded into a Boolean algebra completely isomorphically (i.e. preserving every supremum and infimum) a distributive lattice L must satisfy the infinite distributive law, as the infinite distributivity holds in Boolean algebras. The main purpose of this paper is to prove that the converse is also true, that is, any infinitely distributive lattice can be imbedded completely isomorphically in a Boolean algebra (Theorem 6). Since we show, on the other hand, that any relatively complemented distribu tive lattice is infinitely distributive (Theorem 2), Theorem 6 implies that every relatively complemented distributive lattice can be imbedded completely isomorphically in a Boolean algebra (Theorem 4).

Profinite Heyting Algebras and Profinite Completions of Heyting Algebras

2009 ◽  
Vol 16 (1) ◽  
pp. 29-47
Author(s):  
Guram Bezhanishvili ◽  
Patrick J. Morandi
Keyword(s):  
Boolean Algebra ◽  
Distributive Lattice ◽  
Heyting Algebra ◽  
Boolean Algebras ◽  
Distributive Lattices ◽  
Heyting Algebras ◽  
Profinite Completion ◽  
Bounded Distributive Lattice ◽  
Recent Developments ◽  
Profinite Completions

Abstract This paper surveys recent developments in the theory of profinite Heyting algebras (resp. bounded distributive lattices, Boolean algebras) and profinite completions of Heyting algebras (resp. bounded distributive lattices, Boolean algebras). The new contributions include a necessary and sufficient condition for a profinite Heyting algebra (resp. bounded distributive lattice) to be isomorphic to the profinite completion of a Heyting algebra (resp. bounded distributive lattice). This results in simple examples of profinite bounded distributive lattices that are not isomorphic to the profinite completion of any bounded distributive lattice. We also show that each profinite Boolean algebra is isomorphic to the profinite completion of some Boolean algebra. It is still an open question whether each profinite Heyting algebra is isomorphic to the profinite completion of some Heyting algebra.

scholarly journals Dumont's Statistic on Words

10.37236/1555 ◽  
2001 ◽  
Vol 8 (1) ◽  
Author(s):  
Mark Skandera
Keyword(s):  
Symmetric Group ◽  
Distributive Lattice ◽  
Distributive Lattices ◽  
Finite Distributive Lattices

We define Dumont's statistic on the symmetric group $S_n$ to be the function dmc: $S_n \rightarrow {\bf N}$ which maps a permutation $\sigma$ to the number of distinct nonzero letters in code$( \sigma )$. Dumont showed that this statistic is Eulerian. Naturally extending Dumont's statistic to the rearrangement classes of arbitrary words, we create a generalized statistic which is again Eulerian. As a consequence, we show that for each distributive lattice $J(P)$ which is a product of chains, there is a poset $Q$ such that the $f$-vector of $Q$ is the $h$-vector of $J(P)$. This strengthens for products of chains a result of Stanley concerning the flag $h$-vectors of Cohen-Macaulay complexes. We conjecture that the result holds for all finite distributive lattices.

Reimer's Inequality on a Finite Distributive Lattice

2013 ◽  
Vol 22 (4) ◽  
pp. 612-621
Author(s):  
CLIFFORD SMYTH
Keyword(s):  
Distributive Lattice ◽  
Distributive Lattices ◽  
Finite Distributive Lattice ◽  
Finite Distributive Lattices

We generalize Reimer's Inequality [6] (a.k.a. the BKR Inequality or the van den Berg–Kesten Conjecture [1]) to the setting of finite distributive lattices.

scholarly journals The Central Decomposition of FD01(n)

Order ◽  
2021 ◽  
Author(s):  
Peter Köhler
Keyword(s):  
Distributive Lattices ◽  
Finitely Generated ◽  
Finite Distributive Lattices

AbstractThe paper presents a method of composing finite distributive lattices from smaller pieces and applies this to construct the finitely generated free distributive lattices from appropriate Boolean parts.

Sign in / Sign up

Export Citation Format

Share Document