Symmetric chain decomposition of necklace posets
From MaRDI portal
(Redirected from Publication:426785)
Abstract: A finite ranked poset is called a symmetric chain order if it can be written as a disjoint union of rank-symmetric, saturated chains. If is any symmetric chain order, we prove that is also a symmetric chain order, where acts on by cyclic permutation of the factors.
Recommendations
Cited in
(13)- Necklaces, symmetries and self-reciprocal polynomials
- Covering a symmetric poset by symmetric chains
- Symmetric chain decompositions of products of posets with long chains
- On orthogonal symmetric chain decompositions
- Symmetric chain decompositions of quotients by wreath products.
- Combinatorial necklace splitting
- Counting common representatives and symmetric chain decompositions
- scientific article; zbMATH DE number 1075005 (Why is no real title available?)
- scientific article; zbMATH DE number 1506764 (Why is no real title available?)
- Symmetric chain decomposition for cyclic quotients of Boolean algebras and relation to cyclic crystals
- Order ideals in a product of chains
- A combinatorial proof of the unimodality and symmetry of weak composition rank sequences
- The necklace poset is a symmetric chain order
This page was built for publication: Symmetric chain decomposition of necklace posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426785)