Geodesic
Symmetric chain decomposition of necklace posets
The electronic journal of combinatorics, Tome 19 (2012) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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 $\mathcal{P}$ is any symmetric chain order, we prove that $\mathcal{P}^n/\mathbb{Z}_n$ is also a symmetric chain order, where $\mathbb{Z}_n$ acts on $\mathcal{P}^n$ by cyclic permutation of the factors.
DOI : 10.37236/1178
Classification : 05E18, 06A07
Mots-clés : symmetric chain order 
@article{10_37236_1178,
     author = {Vivek Dhand},
     title = {Symmetric chain decomposition of necklace posets},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {1},
     doi = {10.37236/1178},
     zbl = {1244.05233},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1178/}
}
TY  - JOUR
AU  - Vivek Dhand
TI  - Symmetric chain decomposition of necklace posets
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1178/
DO  - 10.37236/1178
ID  - 10_37236_1178
ER  - 
%0 Journal Article
%A Vivek Dhand
%T Symmetric chain decomposition of necklace posets
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1178/
%R 10.37236/1178
%F 10_37236_1178
Vivek Dhand. Symmetric chain decomposition of necklace posets. The electronic journal of combinatorics, Tome 19 (2012) no. 1. doi: 10.37236/1178

Cité par Sources :