On the number of non-comparable pairs of elements in a distributive lattice
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.