On the number of non-comparable pairs of elements in a distributive lattice
arXiv:1311.7262
Abstract
In this article we introduce the study of the number of pairs of non-comparable elements in a distributive lattice . We give several tight lower and upper bounds for the number and give as an application the lattices precisely for which the algebraic variety associated to is a complete intersection.