Symmetric chain decomposition of necklace posets
From MaRDI portal
Publication:426785
zbMATH Open1244.05233arXiv1104.4147MaRDI QIDQ426785FDOQ426785
Authors: Vivek Dhand
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1104.4147
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (13)
- On orthogonal symmetric chain decompositions
- Combinatorial necklace splitting
- Title not available (Why is that?)
- Covering a symmetric poset by symmetric chains
- Order ideals in a product of chains
- Symmetric chain decompositions of products of posets with long chains
- The necklace poset is a symmetric chain order
- Title not available (Why is that?)
- Necklaces, symmetries and self-reciprocal polynomials
- Counting common representatives and symmetric chain decompositions
- Symmetric chain decompositions of quotients by wreath products.
- A combinatorial proof of the unimodality and symmetry of weak composition rank sequences
- Symmetric chain decomposition for cyclic quotients of Boolean algebras and relation to cyclic crystals
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)