Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Fourier Entropy-Influence Conjecture for Boolean Plateaued Functions

Published 18 Sep 2026 in cs.IT and math.CO | (2609.21563v1)

Abstract: We prove the following inequality for Boolean functions: 2∑x∈F2<sup>nf(x)wt(x)≥</sup>wt(f)(n−deg(f))2\sum_{x\in F_2<sup>n}f(x)wt(x)\geq</sup> wt(f)(n-deg(f)). Using this inequality, we establish the Fourier Entropy-Influence (FEI) conjecture for Boolean plateaued functions. In particular, we show that the sharp FEI constant for the class of plateaued functions is 4. We also prove the FEI conjecture for partially bent functions and show that the corresponding sharp constant is 2. Finally, we derive several estimates for the p-biased distribution on the Boolean hypercube. Keywords: Fourier entropy, total influence, average sensitivity, plateaued function, algebraic degree, Reed-Muller code, p-biased distribution.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.