An Identity of Distributive Lattices

preprint2014arXivOpen access

Abstract

In a finite distributive lattice ŁŁ we define two functions s(α)=∣{δ∈L∣δ≤α}∣s(α)=|\{δ\in \mathcal{L} | δ\leq α\}| and l(α)=∣{δ∈L∣δ≥α}∣l(α)=|\{δ\in \mathcal{L} | δ\geq α\}|. In this present article we prove that the sum of these two functions over a finite distributive lattice are equal. Using this identity we give a formula for the number of non-comparable pairs of elements in a finite distributive lattice.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.