Symmetric chain decompositions of B_n and Pi_n
classification
🧮 math.CO
keywords
symmetricchainbruijnchainscollectiondecompositiondecompositionsdisjoint
read the original abstract
We review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decomposition of ${\cal B}_{n}$, and explain how it can be used to find a maximal collection of disjoint symmetric chains in the nonsymmetric lattice of partitions of a set.
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.