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: . 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.
Paper Prompts
Sign up for free to create and run prompts on this paper.