Boolean dimension of a Boolean lattice
Abstract
For every integer n with n ≥ 6, we prove that the Boolean dimension of a poset consisting of all the subsets of \1,…,n\ equipped with the inclusion relation is strictly less than n.
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.