Let f:{−1,1}n→{−1,1} be a Boolean function with Fourier expansion
f(x)=∑S⊆[n]f^(S)χS(x).
Its spectral entropy is
H(f^2) := S⊆[n]∑f^(S)2log2f^(S)21,
and its total influence is
Inf(f) := S⊆[n]∑f^(S)2∣S∣.
[ODWZ2011-defs]
Friedgut and Kalai conjectured that there is a universal constant C>0 such that
H(f^2) ≤ CInf(f)
for every Boolean f.
[ODWZ2011-conj-attr]
We define
C71 := inf{C>0: H(f^2)≤CInf(f) for all Boolean f}.
The conjecture is equivalent to C71<∞, and this remains open.
[ODWZ2011-open-problem]
An explicit balanced, logic-monotone function on 18 variables (exact integer
Fourier spectrum and truth table certified exactly), via the O'Donnell--Tan
amplification rule C≥H/(I−1), gives
C71 > 6.521845710923046575,
and the same certificate shows the bound holds even restricted to monotone
functions.
[Num2026]
Hence the best established range is
6.521845710923046575 < C71 ≤ ∞.