Classification of Posets with the Non-messing-up Property for Two Sets of Chains

Abstract

The so-called Non-Messing-Up Theorem is a well known sorting result for rectangular arrays of real numbers. In [4], Donald E. Knuth attributes the result to Hermann Boerner, who mentions it in a footnote in Chapter V, §5 of [1]. Later, David Gale and Richard M. Karp include the fact as an example in [3], where they prove a more general result about order… (More)

Topics

19 Figures and Tables