Defining the almost-entropic regions by algebraic inequalities

DOI10.1504/IJICOT.2017.10002264MaRDI QIDQ2363732zbMATH OpenFDO

Authors Arley Gomez, Carolina Mejía, J. Andres Montoya

Publication date 26 July 2017

Published in International Journal of Information and Coding Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/IJICOT.2017.10002264

zbMATH Keywords

algebraic inequalitiesentropic regionsentropic vectorsentropyinformation inequalitiespolyhedralitypolynomial inequalitiessemialgebraicityShannon inequalities

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Review text

Summary: We study the definability of the almost-entropic regions by finite lists of algebraic inequalities. First, we study linear information inequalities and polyhedrality, we present a proof of a theorem of Matus, which claims that the almost-entropic regions are not polyhedral. Then, we study polynomial inequalities and semialgebraicity, we show that the semialgebracity of the almost-entropic regions is something that depends on the essentially conditionality of a certain class of conditional information inequalities. Those results suggest that the almost-entropic regions are not semialgebraic. We conjecture that those regions are not decidable.

Recommendations

• Non-linear information inequalities
• On entropy, information inequalities, and groups
• Facets of entropy
• A new class of non-Shannon-type inequalities for entropies
• The inequalities of quantum information theory

Cited in

(2)

• Transcendental properties of entropy-constrained sets
• No Eleventh Conditional Ingleton Inequality

This page was built for publication: Defining the almost-entropic regions by algebraic inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363732)