English

On a problem of M. Talagrand

Combinatorics 2021-05-25 v1

Abstract

We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family F\mathcal F of subsets of a finite set VV. The full conjecture implies equivalence of the "Fractional Expectation-Threshold Conjecture," due to Talagrand and recently proved by the authors and B. Narayanan, and the (stronger) "Expectation-Threshold Conjecture" of the second author and G. Kalai. The conjecture under discussion here says there is a fixed LL such that if, for a given F\mathcal F, p[0,1]p\in [0,1] admits λ:2VR+\lambda:2^V \rightarrow \mathbb R^+ with \mbox{$\sum_{S\subseteq F}\lambda_S\ge 1 ~~\forall F\in \mathcal F$} and \mbox{$\sum_S\lambda_Sp^{|S|} \le 1/2$} (a.k.a. F\mathcal F is weakly pp-small), then p/Lp/L admits such a λ\lambda taking values in {0,1}\{0,1\} (F\mathcal F is (p/L)(p/L)-small). Talagrand showed this when λ\lambda is supported on singletons and suggested, as a more challenging test case, proving it when λ\lambda is supported on pairs. The present work provides such a proof.

Keywords

Cite

@article{arxiv.2105.10905,
  title  = {On a problem of M. Talagrand},
  author = {Keith Frankston and Jeff Kahn and Jinyoung Park},
  journal= {arXiv preprint arXiv:2105.10905},
  year   = {2021}
}

Comments

11 pages

R2 v1 2026-06-24T02:22:58.884Z