Degree vs Sensitivity for Boolean Functions
Improve the exponent in the upper bound that degree has over sensitivity.
On this page:
About the problem
Attempts by AI
AI prompts
Mathematician survey
About the problem
Given a Boolean function $f$, it is known that the sensitivity of $f$, denoted $s(f)$, is at least the square root of its degree, denoted $\deg(f)$, and that this bound is tight.
The upper bound is less clear. It is known that $s(f) \le \bigl(\deg(f)\bigr)^2$, with recent work improving this by a constant $< 1 (\approx 0.83)$. There is also an explicit construction with $s(f) = \bigl( \deg(f) \bigr)^{\log(6)/\log(3)}$. Here the exponent is $\approx 1.63$.
The goal of this problem is to find a novel construction that improves on this bound.
Warm-up: we ask for the current best known lower bound.
Attempts by AI
We have evaluated the following models on this problem. “Warm-up” refers to an easier variant of the problem with a known solution.
AI Prompts
Warm-up
Full problem
Mathematician survey
The author assessed the problem as follows.