PPL 175 / 177 permanent IDsPrize Problem Ledger · PPLChecked 2026.07.27
Prize Problem LedgerTalagrand prize problemsPPL 175Talagrand · Simple combinatorics / discrete convexity

Permanent problem IDPPL 175

Verified openIndependentconjecture

Probability

Talagrand · Simple combinatorics / discrete convexity

For biased product measure Pδ on {0,1}ᴺ, prove Talagrand’s dimension-free q-covering assertion for every high-measure family D—or meet the prize PDF’s stated weaker bound using a parameter δ′ depending only on δ.

product measurescoveringdiscrete convexity
01

The problem

For biased product measure Pδ on {0,1}ᴺ, prove Talagrand’s dimension-free q-covering assertion for every high-measure family D—or meet the prize PDF’s stated weaker bound using a parameter δ′ depending only on δ.

Open since2005documented open by
Last checked2026.07.27Catalog verification
02

Reward offers

Offer 01$1,000Michel Talagrand
Personal offer

Resolve the official statement or its explicitly qualifying relaxation. Talagrand’s general conditions say he will award prizes while able to understand the submitted proof; authorship is not required and no expiry is stated.

03

Sources & reading