The following result is proved by using entropy of hypergraphs. If π1 , . . . , πd are permutations of the n element set P such that for every triple x, y, z ∈ P, one can find a πi such that πi(x) is between πi(y) and πi(z), then n < exp(d/2). We also study k-scrambling permutations. Several problems remained open.
|Number of pages||8|
|Journal||Random Structures and Algorithms|
|Publication status||Published - Mar 1996|
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Applied Mathematics