Defining the almost-entropic regions by algebraic inequalities (Q2363732): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:53, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Defining the almost-entropic regions by algebraic inequalities |
scientific article |
Statements
Defining the almost-entropic regions by algebraic inequalities (English)
0 references
26 July 2017
0 references
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.
0 references
entropic regions
0 references
entropic vectors
0 references
entropy
0 references
information inequalities
0 references
polyhedrality
0 references
Shannon inequalities
0 references
algebraic inequalities
0 references
polynomial inequalities
0 references
semialgebraicity
0 references