For every C>0, some nonconstant Boolean function on a finite sign cube has the sum of its linear Fourier coefficients greater than C√deg(f), where degree is that of its real multilinear representation.
For every C>0, some nonconstant Boolean function on a finite sign cube has the sum of its linear Fourier coefficients greater than C√deg(f), where degree is that of its real multilinear representation.
For every C>0, some nonconstant Boolean function on a finite sign cube has the sum of its linear Fourier coefficients greater than C√deg(f), where degree is that of its real multilinear representation.
If correct, disproves even a constant-factor form of the proposed square-root degree bound.
Can the signed linear Fourier-coefficient sum be bounded by a constant times square-root degree?
Publication dates and editorial changes.
OpenAI reports unbounded violations of the square-root degree bound
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
