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

DOI10.1016/0097-3165(94)90042-6zbMath0794.05006OpenAlexW2292187247MaRDI QIDQ1317461

E. Damiani, Ottavio M. D'Antona, Daniel E. Loeb

Publication date: 17 April 1994

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(94)90042-6

zbMATH Keywords

decompositionsBell numbersymmetric chainpartition latticeparenthesization

Mathematics Subject Classification ID

Partitions of sets (05A18) Boolean algebras (Boolean rings) (06E99) Total orders (06A05)

Related Items

Extremal problems for sets forming Boolean algebras and complete partite hypergraphs ⋮ On quotients of posets, with an application to the \(q\)-analog of the hypercube ⋮ A combinatorial interpretation of punctured partitions

Cites Work

• A simple counterexample to a conjecture of Rota
• Strong versions of Sperner's theorem
• On a problem of Rota
• Superantichains in the Lattice of Partitions of a Set
• On the Connection Constants
• Sufficient Conditions for a Symmetric Chain Order
• Partitions Into Chains of a Class of Partially Ordered Sets
• Combinatorial Structure of the Faces of then-Cube
• Unnamed Item
• Unnamed Item