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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.