Emergent Mind

Abstract

There is a common theme to some research questions in additive combinatorics and noise stability. Both study the following basic question: Let $\mathcal{P}$ be a probability distribution over a space $\Omega\ell$ with all $\ell$ marginals equal. Let $\underline{X}{(1)}, \ldots, \underline{X}{(\ell)}$ where $\underline{X}{(j)} = (X1{(j)}, \ldots, Xn{(j)})$ be random vectors such that for every coordinate $i \in [n]$ the tuples $(Xi{(1)}, \ldots, Xi{(\ell)})$ are i.i.d. according to $\mathcal{P}$. A central question that is addressed in both areas is: - Does there exist a function $c{\mathcal{P}}()$ independent of $n$ such that for every $f: \Omegan \to [0, 1]$ with $\mathrm{E}[f(X{(1)})] = \mu > 0$: \begin{align*} \mathrm{E} \left[ \prod{j=1}\ell f(X{(j)}) \right] \ge c(\mu) > 0 \, ? \end{align*} Instances of this question include the finite field model version of Roth's and Szemer\'edi's theorems as well as Borell's result about the optimality of noise stability of half-spaces. Our goal in this paper is to interpolate between the noise stability theory and the finite field additive combinatorics theory and address the question above in further generality than considered before. In particular, we settle the question for $\ell = 2$ and when $\ell > 2$ and $\mathcal{P}$ has bounded correlation $\rho(\mathcal{P}) < 1$. Under the same conditions we also characterize the obstructions for similar lower bounds in the case of $\ell$ different functions. Part of the novelty in our proof is the combination of analytic arguments from the theories of influences and hyper-contraction with arguments from additive combinatorics.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.

Newsletter

Get summaries of trending comp sci papers delivered straight to your inbox:

Unsubscribe anytime.