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 P is any symmetric chain order, we prove that Pn/mathbbZn is also a symmetric chain order, where mathbbZn acts on Pn by cyclic permutation of the factors.









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)