On the number of non-comparable pairs of elements in a distributive lattice

2013/11/28 by Mukherjee, Himadri
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/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.

Related

• An Identity of Distributive Lattices
• Distributive congruence lattices of congruence-permutable algebras
• On the number of perfect lattices
• Enumeration of lattices of nullity k and containing r comparable reducible elements
• A uniform refinement property for congruence lattices