Noise Correlation Bounds for Uniform Low Degree Functions
Abstract
We study correlation bounds under pairwise independent distributions for functions with no large Fourier coefficients. Functions in which all Fourier coefficients are bounded by δ are called δ- uniform. The search for such bounds is motivated by their potential applicability to hardness of approximation, derandomization, and additive combinatorics. In our main result we show that [f1(X11,...,X1n) ... fk(Xk1,...,Xkn)] is close to 0 under the following assumptions: 1. The vectors \(X1j,...,Xkj) : 1 ≤ j ≤ n\ are i.i.d, and for each j the vector (X1j,...,Xkj) has a pairwise independent distribution. 2. The functions fi are uniform. 3. The functions fi are of low degree. We compare our result with recent results by the second author for low influence functions and to recent results in additive combinatorics using the Gowers norm. Our proofs extend some techniques from the theory of hypercontractivity to a multilinear setup.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.