arXiv (All)
open access
Entropy bounds and global couplings for union-closed families
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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Subset selection problems in planar point sets#925735
- On the structure of the d-indivisible noncrossing partition posets#972366
- Efficient Rejection Sampling in the Entropy-Optimal Range#173267
- Nordhaus--Gaddum relations for degrees and connectivities under the $δ$-complement#1014455
- Quasi-overlap and quasi-grouping functions on bounded pseudo-ordered sets#1050176
Record · ID 985661
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive