arXiv Analytics

Sign in

arXiv:1402.6146 [math.CO]AbstractReferencesReviewsResources

An Identity of Distributive Lattices

Himadri Mukherjee

Published 2014-02-25, updated 2014-03-25Version 2

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

Related articles: Most relevant | Search more
arXiv:1412.0011 [math.CO] (Published 2014-11-28)
On the representation of finite distributive lattices
arXiv:1810.06762 [math.CO] (Published 2018-10-16)
Convex expansion for finite distributive lattices with applications
arXiv:2410.07411 [math.CO] (Published 2024-10-09)
Isometric embeddings of resonance graphs as finite distributive lattices