Non-linear Information Inequalities
AbstractWe construct non-linear information inequalities from Mat´uˇ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. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Chan, T.; Grant, A. Non-linear Information Inequalities. Entropy 2008, 10, 765-775.
Chan T, Grant A. Non-linear Information Inequalities. Entropy. 2008; 10(4):765-775.Chicago/Turabian Style
Chan, Terence; Grant, Alex. 2008. "Non-linear Information Inequalities." Entropy 10, no. 4: 765-775.