arXiv (All)
open access
Reflection of optimal supports for k-wise independent bits
For even k, we derive a reflection identity for the basic count distributions in the problem of maximizing the probability that all n k-wise independent Bernoulli variables equal one. After separating the distinguished node n, the other support nodes reflect by s -> n-1-s while the Bernoulli paramet
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
- Upper Bounds on Efficiency of Pixel Antennas#1156042
- Bounded Independence Edge Subsampling in Graphs#347579
- Construction of Kochen-Specker Sets from Mutually Unbiased Bases#635641
- Construction of Kochen-Specker Sets from Mutually Unbiased Bases#633292
- Finding Shortest Reconfiguration Sequences on Independent Set Polytopes#820440
Record · ID 1061233
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