Minimal Scrambling Sets of Simple Orders,

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)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1971
Accession Number
AD0731264

Entities

People

  • Joel Spencer

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Permutations

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.