ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f ⁣:{0,1}n→{0,1}f\colon\left\{0,1\right\}^{n}\to\left\{0,1\right\} be a monotone Boolean function with expectation E[f]=μ\mathbb{E}[f]=\mu, and let I[f]I[f] denote its total influence. A DNF of width ww is a union of sub-cubes of co-dimension at most ww. Kahn–Kalai's conjecture. For any C,ϵ,μ>0C,\epsilon,\mu>0, there exists w=OC,ϵ(log⁡(1/μ))w=O_{C,\epsilon}\left(\log\left(1/\mu\right)\right) such that, whenever

I[f]≤Cμlog⁡(1/μ),I[f]\le C\mu\log(1/\mu),

ff can be ϵμ\epsilon\mu-approximated by a DNF of width at most ww. This conjecture concerns the structure of biased Boolean functions whose influence is within a constant factor of the minimum possible; the paper presents it as an open problem, while the stated approximation theorem is the target assertion.

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.