The Fourier-Min-Entropy-Influence conjecture
Let be uniform on , and let be a Boolean function with Fourier-Walsh coefficients for . Let denote its total influence,
Fourier-Min-Entropy-Influence conjecture. There exists a constant such that, for every Boolean function ,
This is presented as a weaker conjecture than the Fourier-Entropy-Influence conjecture, but the supplied text gives no evidence resolving it.
Equivalent formulations 1Other wordings
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
Fourier Min-Entropy–Influence conjecture
Let be a Boolean function. Define its Fourier min-entropy by
and let denote its total influence. Fourier Min-Entropy–Influence conjecture. There exists a constant such that
This is a weaker relaxation of the Fourier Entropy–Influence conjecture because spectral entropy dominates Fourier min-entropy. The paper proves the conjecture for regular read- DNFs, while its general validity remains open.
source: Guy Shalev, “On the Fourier Entropy Influence Conjecture for Extremal Classes”, arXiv:1806.03646 (2019).
References
Primary source
Xiao Han, “A new bound for the Fourier-Entropy-Influence conjecture”, arXiv:2312.08271 (2025).
Additional references
2 papers in this index state this conjecture (2023). The statement above is taken from the most recent of them; the others are arXiv:2308.00509.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.