Metraipolis › archive › dc_6524fee73632

Sharp High-Entropy Bounds for Sums of Independent Discrete Random Variables — arXiv:2609.21459

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.21459
License (as archived)
CC0-1.0
Archived
2026-10-10T02:20:03.161Z
SHA-256 of the archived text
90490aa7584d60b59ca22c39955251af56723df46b1d06a3b174aedb3e71db24
Stable URL of this page
https://metraipolis.com/documento/dc_6524fee73632

How to cite

Sharp High-Entropy Bounds for Sums of Independent Discrete Random Variables — arXiv:2609.21459 — arXiv (en), https://arxiv.org/abs/2609.21459 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6524fee73632 (Metraipolis archive dc_6524fee73632, sha256 90490aa7584d60b59ca22c39955251af56723df46b1d06a3b174aedb3e71db24)
BibTeX
@misc{dc6524fee73632,
  title = {Sharp High-Entropy Bounds for Sums of Independent Discrete Random Variables — arXiv:2609.21459},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.21459},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6524fee73632; sha256 90490aa7584d60b59ca22c39955251af56723df46b1d06a3b174aedb3e71db24},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21459. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Sharp high-entropy lower bounds for the entropy of a sum were known for identically distributed summands in torsion-free abelian groups and in prime cyclic groups. For arbitrary independent summands, Gavalakis, Goh and Kontoyiannis obtained an additive constant of $1/8$ and conjectured that the sharp constant is $1/2$. We prove that independent discrete random variables $X,Y$ with finite Shannon entropies satisfy $H(X+Y)\ge (H(X)+H(Y))/2+1/2-o(1)$ in every torsion-free abelian group as $\max{H(X),H(Y)}\to\infty$. The same conclusion holds in the prime cyclic group $\mathbb F_p$ when both $\max{H(X),H(Y)}$ and $\log_2 p-\max{H(X),H(Y)}$ tend to infinity. We give explicit error bounds in both settings. The proof extracts a component with paired point probabilities while controlling the entropy of the remainder independently of its support. Discrete rearrangement and uniform perturbation then transfer the continuous entropy power inequality to this component. In prime cyclic groups, an additional estimate controls the entropy lost under modular reduction. Binomial distributions show that the constant $1/2$ is optimal.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.21459 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T02:04:28.737Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).