Scrambling permutations and entropy of hypergraphs

Research output: Contribution to journalArticle

7 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
Publication statusPublished - Mar 1996

Fingerprint

Hypergraph
Permutation
Entropy
Open Problems

ASJC Scopus subject areas

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

Cite this

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

In: Random Structures and Algorithms, Vol. 8, No. 2, 03.1996, p. 97-104.

Research output: Contribution to journalArticle

@article{a1e4ac8cccbb4137a76a7db1ac339fa2,
title = "Scrambling permutations and entropy of hypergraphs",
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",
author = "Zolt{\'a}n F{\"u}redi",
year = "1996",
month = "3",
language = "English",
volume = "8",
pages = "97--104",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "2",

}

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 -