arXiv (All)
open access
A Proof of the Most Informative Boolean Function Conjecture
Let $X$ be uniform on $\{-1,1\}^n$, let $Y$ be obtained by passing its coordinates independently through a binary symmetric channel with crossover probability $p$, and let $g:\{-1,1\}^n\to\{0,1\}$ be a Boolean function. We give a computer-assisted proof of the Courtade--Kumar conjecture $I(g(X);Y)\l
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
- Probabilistic proofs and transferability#86109
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#924468
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#920237
- Symmetrization resistance for exponential and geometric distributions#998302
- Bounded Independence Edge Subsampling in Graphs#347579
Record · ID 1051327
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