Information Inequalities via Ideas from Additive Combinatorics
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913679062073344 |
|---|---|
| author | Lau, Chin Wa Nair, Chandra |
| author_facet | Lau, Chin Wa Nair, Chandra |
| contents | Ruzsa's equivalence theorem provided a framework for converting certain families of inequalities in additive combinatorics to entropic inequalities (which sometimes did not possess stand-alone entropic proofs). In this work, we first establish formal equivalences between some families (different from Ruzsa) of inequalities in additive combinatorics and entropic ones. As a first step to further these equivalences, we establish an information-theoretic characterization of the magnification ratio that could also be of independent interest. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_11017 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Information Inequalities via Ideas from Additive Combinatorics Lau, Chin Wa Nair, Chandra Information Theory Combinatorics Number Theory Ruzsa's equivalence theorem provided a framework for converting certain families of inequalities in additive combinatorics to entropic inequalities (which sometimes did not possess stand-alone entropic proofs). In this work, we first establish formal equivalences between some families (different from Ruzsa) of inequalities in additive combinatorics and entropic ones. As a first step to further these equivalences, we establish an information-theoretic characterization of the magnification ratio that could also be of independent interest. |
| title | Information Inequalities via Ideas from Additive Combinatorics |
| topic | Information Theory Combinatorics Number Theory |
| url | https://arxiv.org/abs/2312.11017 |