Metraipolis › archive › dc_7c7e32fa581b

A simple proof of the group-theoretic Zhang-Yeung inequality — arXiv:2609.35451

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.35451
License (as archived)
CC0-1.0
Archived
2026-10-07T23:47:00.562Z
SHA-256 of the archived text
7499435f5a0a18e987dbf8f38e47d67fac522ebfb4d7c27177d8d96ac1524f1b
Stable URL of this page
https://metraipolis.com/documento/dc_7c7e32fa581b

How to cite

A simple proof of the group-theoretic Zhang-Yeung inequality — arXiv:2609.35451 — arXiv (en), https://arxiv.org/abs/2609.35451 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7c7e32fa581b (Metraipolis archive dc_7c7e32fa581b, sha256 7499435f5a0a18e987dbf8f38e47d67fac522ebfb4d7c27177d8d96ac1524f1b)
BibTeX
@misc{dc7c7e32fa581b,
  title = {A simple proof of the group-theoretic Zhang-Yeung inequality — arXiv:2609.35451},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.35451},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7c7e32fa581b; sha256 7499435f5a0a18e987dbf8f38e47d67fac522ebfb4d7c27177d8d96ac1524f1b},
  year = {2026}
}

Archived text

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

Zhang and Yeung (IEEE Trans. Inf. Theory, 1998) established the first non-Shannon-type inequality that holds for all entropic vectors. Chan and Yeung (IEEE Trans. Inf. Theory, 2002) showed that there is a one-to-one relation between linear entropy inequalities and multiplicative inequalities involving cardinalities of subgroups of a finite group. The Shannon inequality admits a simple proof in the group theoretic setting, but a direct proof of the translation of Zhang--Yeung's inequality to the group-theoretic setting remained elusive. We resolve this open problem, giving a direct proof of the group-theoretic Zhang--Yeung inequality for cardinalities of subgroups of finite groups, using elementary group-theoretic and counting arguments.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.35451 — 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-07T23:26:01.137Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).