2000 character limit reached
On the Analysis of Boolean Functions and Fourier-Entropy-Influence Conjecture (2308.00509v3)
Published 1 Aug 2023 in math.CO and math.FA
Abstract: This manuscript includes some classical results we select apart from the new results we've found on the Analysis of Boolean Functions and Fourier-Entropy-Influence conjecture. We try to ensure the self-completeness of this work so that readers could probably read it independently. Among the new results, what is the most remarkable is that we prove that the entropy of a boolean function $f$ could be upper bounded by $O(I(f))+O(\sum\limits_{k}I_k(f)\log (1/I_k(f)))$.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.