Metraipolis › archive › dc_d4b2e671e420
A Log-Star Comparison Between Expectation Threshold and Fractional Expectation Threshold — arXiv:2609.30680
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30680
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T02:57:38.617Z
- SHA-256 of the archived text
75c8a75780eed81cbc04436d649da34bd0564f3d460da07cb9674c494ab819ec- Stable URL of this page
https://metraipolis.com/documento/dc_d4b2e671e420
How to cite
A Log-Star Comparison Between Expectation Threshold and Fractional Expectation Threshold — arXiv:2609.30680 — arXiv (en), https://arxiv.org/abs/2609.30680 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d4b2e671e420 (Metraipolis archive dc_d4b2e671e420, sha256 75c8a75780eed81cbc04436d649da34bd0564f3d460da07cb9674c494ab819ec)
BibTeX
@misc{dcd4b2e671e420,
title = {A Log-Star Comparison Between Expectation Threshold and Fractional Expectation Threshold — arXiv:2609.30680},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30680},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d4b2e671e420; sha256 75c8a75780eed81cbc04436d649da34bd0564f3d460da07cb9674c494ab819ec},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30680. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We proved a log-star comparison between the expectation threshold $q(\mathcal F)$ and the fractional expectation threshold $q_f(\mathcal F)$ for any nontrivial increasing family $\mathcal F$ on a finite ground set $V$ of size $|V|=N$. Specifically, we show that $$q_f(\mathcal F)\le64\log_2^*(N+2)\,q(\mathcal F),$$ where we define $\log_2^* x$ to be the least integer $k\ge0$ such that applying $\log_2$ repeatedly $k$ times gives a number at most $1$. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-28 in math.PR). Categorie arXiv: Combinatorics (math.CO) ; Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2609.30680 — 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-08T02:27:13.373Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).