Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2509.12439 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918149611323392 |
|---|---|
| author | Csirmaz, Laszlo |
| author_facet | Csirmaz, Laszlo |
| contents | The paper explores three known methods, their variants and limitations, that can be used to obtain new entropy inequalities. The Copy Lemma was distilled from the original Zhang-Yeung construction which produced the first non-Shannon inequality. Its iterated version, effects of symmetrizations, and connections with polyhedral vertex enumeration are discussed. Another method, derived from the principle of maximum entropy, has the Copy Lemma as a special case. Nevertheless, none of the two presented variants is known to generate more inequalities than the iterated Copy Lemma. Finally, the Ahlswede-Körner method is shown to employ a hidden application of the Copy Lemma - the underlying lemma alone cannot generate new inequalities -, which makes this method strictly weaker than the Copy Lemma. The paper is written in a tutorial style and concludes with a list of open questions and research problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_12439 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Exploring the entropic region Csirmaz, Laszlo Information Theory 06B35, 26A12, 52B12, 90C29 The paper explores three known methods, their variants and limitations, that can be used to obtain new entropy inequalities. The Copy Lemma was distilled from the original Zhang-Yeung construction which produced the first non-Shannon inequality. Its iterated version, effects of symmetrizations, and connections with polyhedral vertex enumeration are discussed. Another method, derived from the principle of maximum entropy, has the Copy Lemma as a special case. Nevertheless, none of the two presented variants is known to generate more inequalities than the iterated Copy Lemma. Finally, the Ahlswede-Körner method is shown to employ a hidden application of the Copy Lemma - the underlying lemma alone cannot generate new inequalities -, which makes this method strictly weaker than the Copy Lemma. The paper is written in a tutorial style and concludes with a list of open questions and research problems. |
| title | Exploring the entropic region |
| topic | Information Theory 06B35, 26A12, 52B12, 90C29 |
| url | https://arxiv.org/abs/2509.12439 |