A Non-Messing-Up Phenomenon for Posets

Details A Non-Messing-Up Phenomenon for Posets A Non-Messing-Up Phenomenon for Posets

2004-04-22

arxiv.org/abs/math/0404396v4

Mathematics

Combinatorics

Scientific paper

We classify finite posets with a particular sorting property, generalizing a
result for rectangular arrays. Each poset is covered by two sets of disjoint
saturated chains such that, for any original labeling, after sorting the labels
along both sets of chains, the labels of the chains in the first set remain
sorted. We also characterize posets with more restrictive sorting properties.

Affiliated with

Also associated with

No associations

Rating

A Non-Messing-Up Phenomenon for Posets 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 A Non-Messing-Up Phenomenon for Posets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Non-Messing-Up Phenomenon for Posets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-662047