  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.
