Minimum Fourier entropy–influence conjecture

From papers

Let f:{1,1}n{1,1}f:\{-1,1\}^n\to\{-1,1\} be a Boolean function. Its minimum Fourier entropy and total influence are

H(f)=minS[n]log1f^(S)2,I(f)=S[n]f^(S)2S.\operatorname{\mathbf{H}}_{\infty}(f)=\min_{S\subset[n]}\log\frac{1}{|\widehat f(S)|^2},\qquad \operatorname{\mathbf{I}}(f)=\sum_{S\subset[n]}|\widehat f(S)|^2|S|.

Minimum Fourier entropy–influence conjecture. There exists a constant c>0c>0 such that, for every nn and every Boolean function ff,

H(f)cI(f).\operatorname{\mathbf{H}}_{\infty}(f)\leq c\operatorname{\mathbf{I}}(f).

This is the minimum-entropy analogue of the Fourier entropy–influence conjecture. The supplied excerpt gives no resolution status or additional evidence, so the conjecture is recorded as open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

María José González, Paul MacManus and María Cristina Pereyra, “Las funciones booleans y el lema de Bonami”, arXiv:2502.13231 (2025).

Solutions 0

No solutions have been posted yet.