ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let U1,…,Uk,Uk+1,…,U2k,U2k+1,…,UnU_1,\ldots,U_k,U_{k+1},\ldots,U_{2k},U_{2k+1},\ldots,U_n be independent and identically distributed random variables with the uniform distribution on (0,1)(0,1). Let F1,…,FT⊂[k]×{2k+1,…,n}F_1,\ldots,F_T\subset [k]\times\{2k+1,\ldots,n\} and H1,…,HT⊂{k+1,…,2k}×{2k+1,…,n}H_1,\ldots,H_T\subset\{k+1,\ldots,2k\}\times\{2k+1,\ldots,n\}, where T≥1T\geq 1, ∣Ft∣=∣Ht∣=m≤k|F_t|=|H_t|=m\leq k for every t∈[T]t\in[T], and

∑j=1m1{(i,j)∈Ft}≤1for every i∈[k], t∈[T],\sum_{j=1}^{m}\mathbf{1}_{\{(i,j)\in F_t\}}\leq 1\quad\text{for every }i\in[k],\ t\in[T],

with the analogous condition

∑j=1m1{(i,j)∈Ht}≤1for every i∈{k+1,…,2k}, t∈[T].\sum_{j=1}^{m}\mathbf{1}_{\{(i,j)\in H_t\}}\leq 1\quad\text{for every }i\in\{k+1,\ldots,2k\},\ t\in[T].

General CNF–DNF correlation conjecture. Under these assumptions, the inequality referred to in the source as the CNF–DNF inequality holds.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.