2000 character limit reached
KKL theorem for the influence of a set of variables
Published 29 Mar 2024 in math.CO, cs.DM, and math.PR | (2404.00084v1)
Abstract: We study the notion of the influence of a set of variables on a Boolean function, which was recently introduced by Tal. We show that for an arbitrary fixed $d$, every Boolean function $f$ on $n$ variables admits a $d$-set of influence at least $\frac{1}{10} \mathbf{W}{\geq d}(f) (\frac{\log n}{n})d$, which is a direct generalisation of the Kahn-Kalai-Linial theorem. We give an example demonstrating essential sharpness of this result. Further, we generalise a related theorem of Oleszkiewicz regarding influences of pairs of variables.
Paper 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.