### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 97-104 |

Number of pages | 8 |

Journal | Random Structures and Algorithms |

Volume | 8 |

Issue number | 2 |

Publication status | Published - Mar 1996 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Graphics and Computer-Aided Design
- Software
- Mathematics(all)
- Applied Mathematics

### Cite this

*Random Structures and Algorithms*,

*8*(2), 97-104.

**Scrambling permutations and entropy of hypergraphs.** / Füredi, Zoltán.

Research output: Contribution to journal › Article

*Random Structures and Algorithms*, vol. 8, no. 2, pp. 97-104.

}

TY - JOUR

T1 - Scrambling permutations and entropy of hypergraphs

AU - Füredi, Zoltán

PY - 1996/3

Y1 - 1996/3

N2 - 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

AB - 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

UR - http://www.scopus.com/inward/record.url?scp=0040793884&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0040793884&partnerID=8YFLogxK

M3 - Article

VL - 8

SP - 97

EP - 104

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 2

ER -