Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains (Q1317461)

The authors prove in an unexpected elementary way that the lattice \(\Pi_ n\) of partitions of an \(n\)-element set can be decomposed into saturated chains such that in each chain the sum of the rank of the minimal element and the rank of the maximal element is not less than the rank of \(\Pi_ n\). Using a certain coding \(\Pi_ n\) is hereby first decomposed into smaller induced subposets which correspond to chains in a well-known symmetric chain partition of the Boolean lattice \({\mathcal B}_{n-1}\) and which lie in the ``middle'' of \(\Pi_ n\). Then it is shown that in these subposets lower levels can be matched into upper levels. As an application of the coding a Bell number identity is derived.