Geodesic
Sort-invariant non-messing-up
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A poset has the non-messing-up property if it has two covering sets of disjoint saturated chains so that for any labeling of the poset, sorting the labels along one set of chains and then sorting the labels along the other set yields a linear extension of the poset. The linear extension yielded by thus twice sorting a labeled non-messing-up poset may be independent of which sort was performed first. Here we characterize such sort-invariant labelings for convex subposets of a cylinder. They are completely determined by avoidance of a particular subpattern: a diamond of four elements whose smallest two labels appear at opposite points.
DOI : 10.37236/709
Classification : 06A07, 06A05 
@article{10_37236_709,
     author = {Bridget Eileen Tenner},
     title = {Sort-invariant non-messing-up},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/709},
     zbl = {1246.06003},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/709/}
}
TY  - JOUR
AU  - Bridget Eileen Tenner
TI  - Sort-invariant non-messing-up
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/709/
DO  - 10.37236/709
ID  - 10_37236_709
ER  - 
%0 Journal Article
%A Bridget Eileen Tenner
%T Sort-invariant non-messing-up
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/709/
%R 10.37236/709
%F 10_37236_709
Bridget Eileen Tenner. Sort-invariant non-messing-up. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/709

Cité par Sources :