Scrambling permutations and entropy of hypergraphs

Research output: Contribution to journalArticle

8 Citations (Scopus)

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 languageEnglish
Pages (from-to)97-104
Number of pages8
JournalRandom Structures and Algorithms
Volume8
Issue number2
DOIs
Publication statusPublished - Mar 1996

    Fingerprint

ASJC Scopus subject areas

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

Cite this