Metraipolis › archive › dc_89cf4ac99ef1
Entropy bounds and global couplings for union-closed families — arXiv:2609.08291
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.08291
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:48:56.608Z
- SHA-256 of the archived text
69e5cccce035636be1449ed9d983efdecc7d7bc1d0c6d4f466c601038ebc1a02- Stable URL of this page
https://metraipolis.com/documento/dc_89cf4ac99ef1
How to cite
Entropy bounds and global couplings for union-closed families — arXiv:2609.08291 — arXiv (en), https://arxiv.org/abs/2609.08291 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_89cf4ac99ef1 (Metraipolis archive dc_89cf4ac99ef1, sha256 69e5cccce035636be1449ed9d983efdecc7d7bc1d0c6d4f466c601038ebc1a02)
BibTeX
@misc{dc89cf4ac99ef1,
title = {Entropy bounds and global couplings for union-closed families — arXiv:2609.08291},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.08291},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_89cf4ac99ef1; sha256 69e5cccce035636be1449ed9d983efdecc7d7bc1d0c6d4f466c601038ebc1a02},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08291. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We give a computer-assisted proof that every finite union-closed family containing a nonempty set has an element in at least 0.38288525 of its members. The argument combines independent sampling with conditionally independent sampling and an explicit product lower bound for a binary-entropy kernel. We identify the limiting constant of this pointwise method through a one-variable stationary equation. We also construct a global coupling by balancing inverse union multiplicities and prove a strictly positive, quantitative entropy gain over independent sampling. Combining the two arguments gives an additional frequency bound depending on the size of the family. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.08291 — 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-16T14:32:29.847Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).