Symmetric chain decompositions of Bn and Pin
Erensto Damiani, Ottavio D'Antona, Daniel E. Loeb
Abstract
We review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decomposition of Bn, 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.
Create a lesson
Related papers
Off-Diagonal Induced Ramsey Numbers
Bruno Andrades, Marcelo Campos, Rafael Filipe et al.
Largest Sperner families with bounded VC-dimension
Gennian Ge, Hanyu Wang, Zixiang Xu et al.
Proof of two conjectures on the log-concavity of partition ranks and cranks
Jianxi Mao, Wenle Shi, Bao-Xuan Zhu
The Exact Number of Pentagons in Book-Free Graphs
Wentao Hu
A family of symmetric counterexamples to the bent sum decomposition conjecture
Máté Róbert Kepes, Anita Kercsó-Molnár, Viczián András
Counting graphs admitting a strictly matched involution
Stephan Dominique Andres, Igor Režan