Minimal Scrambling Sets of Simple Orders.

by J. H. Spencer

Purchase

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback14 pages $20.00 $16.00 20% Web Discount

Let 2 less than or equal to k less than 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*-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. 14 pp. Ref. (Author)

This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.