Metraipolis › archive › dc_862c8eb000cb

Boolean Small-Ball Inequalities for Discrepancy Theory — arXiv:2609.20785

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.20785
License (as archived)
CC0-1.0
Archived
2026-10-10T04:25:54.786Z
SHA-256 of the archived text
2dde9ea429bc515f55e6f9222ce854022ab87ca538cbeeb0bde6a1adf02e8ea1
Stable URL of this page
https://metraipolis.com/documento/dc_862c8eb000cb

How to cite

Boolean Small-Ball Inequalities for Discrepancy Theory — arXiv:2609.20785 — arXiv (en), https://arxiv.org/abs/2609.20785 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_862c8eb000cb (Metraipolis archive dc_862c8eb000cb, sha256 2dde9ea429bc515f55e6f9222ce854022ab87ca538cbeeb0bde6a1adf02e8ea1)
BibTeX
@misc{dc862c8eb000cb,
  title = {Boolean Small-Ball Inequalities for Discrepancy Theory — arXiv:2609.20785},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20785},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_862c8eb000cb; sha256 2dde9ea429bc515f55e6f9222ce854022ab87ca538cbeeb0bde6a1adf02e8ea1},
  year = {2026}
}

Archived text

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

We prove new small-ball inequalities for boolean matrix-series. The leading example is $\mathbb E_s[{\text{det}(I-S^2)^\beta\,\mathbf 1_{\{\|S\|<1\}}}]\ge e^{-O(\beta\tau)}$, which holds for boolean matrix-series $S=\sum_i s_iA_i$ formed using symmetric matrices $A_1,\dots,A_n$ and uniformly random signs $s\in\{\pm1\}^n$. Specifically, this inequality holds for all $\beta\ge1$ with $\tau=\sum_i\text{Tr} A_i^2$, as soon as the maximum of $(\text{Tr} A_i^2)_{i=1}^n$ and a certain variance term are bounded above by universal constants. The proof combines the Gaussian reciprocal estimate of (Akbas and Sra 2026), the directional-variation signing theorem of (Guo, Fang, and Lu 2026), and a replica argument that turns existence into a Gibbs law on good signings. Most notably, boolean small-ball delivers a new, interlacing-free proof of Kadison-Singer (most general case); it also recovers Matrix Spencer and Komlós as quick corollaries, while yielding more than six almost immediate proofs of an assortment of discrepancy theoretic problems.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.PR).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO); Functional Analysis (math.FA).
Pagina del lavoro: https://arxiv.org/abs/2609.20785 — 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-10T04:09:58.357Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).