Non-linear information inequalities (Q845382)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Non-linear information inequalities |
scientific article; zbMATH DE number 5664147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-linear information inequalities |
scientific article; zbMATH DE number 5664147 |
Statements
Non-linear information inequalities (English)
0 references
29 January 2010
0 references
Summary: We construct non-linear information inequalities from Matúš's infinite series of linear information inequalities. Each single non-linear inequality is sufficiently strong to prove that the closure of the set of all entropy functions is not polyhedral for four or more random variables, a fact that was already established using the series of linear inequalities. To the best of our knowledge, they are the first non-trivial examples of non-linear information inequalities.
0 references
entropy
0 references
entropy function
0 references
nonlinear information inequality
0 references
nonshannon type information inequality
0 references
0.864366888999939
0 references
0.8172064423561096
0 references
0.8168961405754089
0 references
0.8164363503456116
0 references
0.8031786680221558
0 references
