arXiv (All)
open access
Entropic Inequalities and Limit Theorems in Boolean Probability
We study Boolean entropy and Fisher information in information inequalities and the Boolean central limit theorem. We prove a fractional Stam inequality for the Boolean Fisher information associated with arbitrary fractional partitions of subset sums, and derive an entropy power inequality for sums
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
- On Han- and Shearer-Type Information Inequalities: Equality Conditions and Combinatorial Applications#1344191
- Optimal Sparsifiers for Minkowski Sums and Sums of Seminorms#1034006
- Construction of Kochen-Specker Sets from Mutually Unbiased Bases#635641
- Construction of Kochen-Specker Sets from Mutually Unbiased Bases#633292
- Noisy-Channel Minimum Bayes Risk Decoding#343487
Record · ID 1355110
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