Metraipolis › archive › dc_f85db2324475

Thresholds and spread in set systems of bounded VC-dimension — arXiv:2609.30263

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.30263
License (as archived)
CC0-1.0
Archived
2026-10-08T06:41:07.183Z
SHA-256 of the archived text
9b7dd97c5ad964ef42854d5d274a3c0ddaae2a6e948bb6012867cca3a815be25
Stable URL of this page
https://metraipolis.com/documento/dc_f85db2324475

How to cite

Thresholds and spread in set systems of bounded VC-dimension — arXiv:2609.30263 — arXiv (en), https://arxiv.org/abs/2609.30263 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f85db2324475 (Metraipolis archive dc_f85db2324475, sha256 9b7dd97c5ad964ef42854d5d274a3c0ddaae2a6e948bb6012867cca3a815be25)
BibTeX
@misc{dcf85db2324475,
  title = {Thresholds and spread in set systems of bounded VC-dimension — arXiv:2609.30263},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.30263},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f85db2324475; sha256 9b7dd97c5ad964ef42854d5d274a3c0ddaae2a6e948bb6012867cca3a815be25},
  year = {2026}
}

Archived text

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

Let $p_c(\mathcal F)$, $q(\mathcal F)$, and $q_f(\mathcal F)$ denote the threshold, expectation threshold, and fractional expectation threshold of a family $\mathcal F$ of nonempty subsets of a finite set, respectively. We prove that there is an absolute constant $C>0$ such that, if $\mathcal F$ has VC dimension at most $d\ge1$, then $p_c(\mathcal F)\le Cq(\mathcal F)\log(d+1)$. More generally, for every $0<\varepsilon\le1/2$, a binomial random set of density $\min\{1,Cq(\mathcal F)\log((d+1)/\varepsilon)\}$ contains a member of $\mathcal F$ with probability at least $1-\varepsilon$. Consequently, $q_f(\mathcal F)\le Cq(\mathcal F)\log(d+1)$, verifying Talagrand's integral--fractional conjecture for families of any fixed VC dimension. We also prove that if a $k$-spread probability measure has support of VC dimension at most $d$, then a binomial random set of density $\min\{1,(C/k)\log((d+1)/\varepsilon)\}$ contains a member of its support with probability at least $1-\varepsilon$. In both random-containment results, the factor \(\log((d+1)/\varepsilon)\) is optimal up to absolute constants. As an application of the spread theorem, we prove that every $n$-uniform family of VC dimension at most $d$ with more than $(C p^{-1}\log((d+1)/\varepsilon))^n$ members contains a $(p,\varepsilon)$-robust sunflower. In particular, every such family with more than $(Cr\log(d+1))^n$ members contains an $r$-sunflower, improving the recent bound $(Crd)^n$ of Ge, Wang, Xu, and Zhao.

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