ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XnX^n be i.i.d. Bernoulli(1/2)(1/2), let ZnZ^n be i.i.d. Bernoulli(α)(\alpha) independently of XnX^n, where 0≤α≤1/20\leq\alpha\leq 1/2, and let Yn=Xn⊕ZnY^n=X^n\oplus Z^n. Write Ω={0,1}\Omega=\{0,1\} and Ωn={0,1}n\Omega_n=\{0,1\}^n. A Boolean function b:Ωn→Ωb:\Omega_n\to\Omega is lex when b−1(0)b^{-1}(0) is the initial segment of the lexicographic ordering having cardinality ∣b−1(0)∣|b^{-1}(0)|. For fixed nn and fixed ∣b−1(0)∣|b^{-1}(0)|, the lexicographic minimization conjecture. The conditional entropy

H(b(Xn)∣Yn)H(b(X^n)\mid Y^n)

is minimized when bb is lex. This is proposed as a refinement of the mutual-information conjecture and concerns the extremal behavior of Boolean functions under binary symmetric noise; it remains open in the supplied text.

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.