๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the relation of KS entropy and permutation entropy

โœ Scribed by Karsten Keller; Anton M. Unakafov; Valentina A. Unakafova

Book ID
116836040
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
271 KB
Volume
241
Category
Article
ISSN
0167-2789

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scrambling permutations and entropy of h
Scrambling permutations and entropy of hypergraphs
โœ Zoltรกn Fรผredi ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 385 KB

The following result is proved by using entropy of hypergraphs. If r , , . . . , r,, are permutations of the n element set P such that for every triple x , y , z E P, one can find a ri such that ~~( x ) is between r i ( y ) and r i ( z ) , then n < exp(d/2). We also study k-scrambling permutations.