English

An Identity of Distributive Lattices

Combinatorics 2014-03-26 v2

Abstract

In a finite distributive lattice \L\L we define two functions s(α)={δLδα}s(\alpha)=|\{\delta \in \mathcal{L} | \delta \leq \alpha \}| and l(α)={δLδα}l(\alpha)=|\{\delta \in \mathcal{L} | \delta \geq \alpha \}|. 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.

Keywords

Cite

@article{arxiv.1402.6146,
  title  = {An Identity of Distributive Lattices},
  author = {Himadri Mukherjee},
  journal= {arXiv preprint arXiv:1402.6146},
  year   = {2014}
}