acceptodds
Preprint in the OpenAI Math release

Unbounded Violations of the Square-Root Degree Bound

OpenAI

Abstract

We disprove the Gopalan–Servedio square-root conjecture, even up to an arbitrary constant factor. For every real C > 0, there is a nonconstant Boolean function on a finite sign cube such that Here is the linear Fourier coefficient associated with the ith input, and is the degree of the real multilinear polynomial representing f.

open until 1 Jan 2028

est. 50% chance this result is independently verified by the end of 2027.

Not verified 50%Verified 50%

What do you think this paper will get?

All positions stay anonymous.

Discussion (0)

Sign in to comment.