Intervals of Antichains and Their Decompositions
classification
🧮 math.CO
keywords
antichainantichainssubsetsubsetsintervalsnumbercountingcounts
read the original abstract
An antichain of subsets is a set of subsets such that no subset in the antichain is a proper subset of any other subset in the antichain. The Dedekind number counts the total number of antichains of subsets of an n-element set. This paper investigates the interval structure of the lattice of antichains. Several partitioning theorems and counting formulas for the size of intervals are derived.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.