Accession Number : AD0731264

Title :   Minimal Scrambling Sets of Simple Orders,

Corporate Author : RAND CORP SANTA MONICA CALIF

Personal Author(s) : Spencer,Joel

Report Date : JAN 1971

Pagination or Media Count : 13

Abstract : Let 2 < or = k < n be fixed integers, a family F of simple orders on an n element set is said to be k-suitable if of every k elements in the n set, each one is the largest of the k in some simple order in F. Bounds are found on the minimal size of such an F. F is said to be k star-suitable if for every k elements in the n-set each permutation of the k elements is realized in some simple order in F. Again bounds are found on the minimal size of such an F. (Author)

Descriptors :   (*SET THEORY, SEQUENCES), PERMUTATIONS, PROBABILITY

Subject Categories : Statistics and Probability

Distribution Statement : APPROVED FOR PUBLIC RELEASE