
Accession Number : AD0721356
Title : The NonMessingUp Theorem,
Corporate Author : CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
Personal Author(s) : Gale,David ; Karp,Richard M.
Report Date : MAR 1971
Pagination or Media Count : 23
Abstract : The paper is concerned with the ordering of certain sets in different ways. A typical example is a rectangular array of playing cards which can be ordered so that either (a) the rows are in increasing order left to right or (b) the columns are in increasing order top to bottom. It turns out that if the rows are initially ordered then they remain so even after one has ordered the columns. The paper proves this as a special case of a considerably more general nonmessingup phenomenon. (Author)
Descriptors : (*MATHEMATICAL LOGIC, THEOREMS), SET THEORY, PROBLEM SOLVING, SCHEDULING
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE