Decompositions of B_ n and _ n using symmetric chains
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.
- Symmetric Chain Decompositions of Linear Lattices
- Symmetric chain decompositions of quotients by wreath products.
- On orthogonal symmetric chain decompositions
- Symmetric chain decompositions of products of posets with long chains
- q-analogues of determinants and symmetric chain decompositions
- On the existence of symmetric chain decompositions in a quotient of the Boolean lattice
- scientific article; zbMATH DE number 4067178
- Symmetric chain decomposition for cyclic quotients of Boolean algebras and relation to cyclic crystals
- Publication:4503708
- Decomposition of the conjugacy representation of the symmetric groups
- A simple counterexample to a conjecture of Rota
- Combinatorial Structure of the Faces of then-Cube
- scientific article; zbMATH DE number 3974960 (Why is no real title available?)
- scientific article; zbMATH DE number 3065933 (Why is no real title available?)
- On a problem of Rota
- On the Connection Constants
- Partitions Into Chains of a Class of Partially Ordered Sets
- Strong versions of Sperner's theorem
- Sufficient Conditions for a Symmetric Chain Order
- Superantichains in the Lattice of Partitions of a Set
- Applications of the symmetric chain decomposition of the lattice of divisors
- Explicit semisymmetric chain decomposition of the partition lattice
- A combinatorial interpretation of punctured partitions
- 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
- Computer-generated symmetric chain decompositions for \(L(4,n)\) and \(L(3,n)\)
- Order-matchings in the partition lattice
This page was built for publication: Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317461)
