Under the auspices of the Computational Complexity Foundation (CCF)
We show that there are degree-$d$ polynomials over $\mathbb{F}_{2}$ withcorrelation $\Omega(d/\sqrt{n})$ with the majority function on $n$bits. This matches the $O(d/\sqrt{n})$ bound by Smolensky.