Premium
Scrambling permutations and entropy of hypergraphs
Author(s) -
Füredi Zoltán
Publication year - 1996
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/(sici)1098-2418(199603)8:2<97::aid-rsa1>3.0.co;2-j
Subject(s) - scrambling , combinatorics , hypergraph , mathematics , entropy (arrow of time) , discrete mathematics , physics , algorithm , thermodynamics
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