Metraipolis › archive › dc_da4ff6974a68

Reflection of optimal supports for k-wise independent bits — arXiv:2609.25595

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25595
License (as archived)
CC0-1.0
Archived
2026-10-08T15:54:22.423Z
SHA-256 of the archived text
c788ccb7274eb7afc446416a78ba85ce00aebec9949448b04f412552dc4a37b4
Stable URL of this page
https://metraipolis.com/documento/dc_da4ff6974a68

How to cite

Reflection of optimal supports for k-wise independent bits — arXiv:2609.25595 — arXiv (en), https://arxiv.org/abs/2609.25595 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_da4ff6974a68 (Metraipolis archive dc_da4ff6974a68, sha256 c788ccb7274eb7afc446416a78ba85ce00aebec9949448b04f412552dc4a37b4)
BibTeX
@misc{dcda4ff6974a68,
  title = {Reflection of optimal supports for k-wise independent bits — arXiv:2609.25595},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25595},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_da4ff6974a68; sha256 c788ccb7274eb7afc446416a78ba85ce00aebec9949448b04f412552dc4a37b4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25595. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 parameter changes from p to 1-p. Corresponding basic weights differ by an explicit positive factor. Thus interior feasibility sets, and local changes of optimal support with their multiplicities, are reflected. This gives a proof of the exceptional-point reflection in Conjecture 5.11 of Berend, Ernst, Kontorovich and Kumar. The argument uses Lagrange interpolation and an elementary binomial reweighting identity; it does not require a conjectured ordering or connectedness of the feasibility sets.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.25595 — 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-08T15:13:13.515Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).