Sort-Invariant Non-Messing-Up

Details Sort-Invariant Non-Messing-Up Sort-Invariant Non-Messing-Up

2010-09-21

arxiv.org/abs/1009.4201v1

Mathematics

Combinatorics

8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Sort-Invariant Non-Messing-Up does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sort-Invariant Non-Messing-Up, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sort-Invariant Non-Messing-Up will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-637013