The number of meets between two subsets of a lattice

DOI10.1016/0097-3165(79)90063-3zbMath0421.06004OpenAlexW2091294547MaRDI QIDQ1132900

Douglas B. West, Daniel J. Kleitman, David E. Daykin

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(79)90063-3

zbMATH Keywords

finite latticesdirect products of chainsenumeration of subsets

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Lattice ideals, congruence relations (06B10)

Related Items

Towards characterizing equality in correlation inequalities, Jacobsthal numbers in generalised Petersen graphs, Optimal pairs of incomparable clouds in multisets, Inequalities for a pair of maps \(S\times S\to S\) with \(S\) a finite set, Jacobsthal Numbers in Generalized Petersen Graphs, An inequality for partially ordered sets, An inequality for the weights of two families of sets, their unions and intersections, A Hierarchy of Inequalities

Cites Work

• The proof of a conjecture of G. O. H. Katona
• Intersection theorems and a lemma of Kleitman
• A THEOREM ON FINITE SETS
• Combinatorial applications of an inequality from statistical mechanics
• Families of Non-disjoint subsets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item