## Abstract

The non-linear invariance principle of Mossel, O'Donnell, and Oleszkiewicz establishes that if f (x_{1}, . . . , x_{n}) is a multilinear low-degree polynomial with low influences, then the distribution of f (B_{1}, . . . , B_{n} ) is close (in various senses) to the distribution of f (G_{1}, . . . , G_{n} ), where B_{i} ∈_{R}{-1, 1} are independent Bernoulli random variables and G_{i} ~ N(0, 1) are independent standard Gaussians. The invariance principle has seen many applications in theoretical computer science, including the Majority is Stablest conjecture, which shows that the Goemans-Williamson algorithm for MAX-CUT is optimal under the Unique Games Conjecture. More generally, MOO's invariance principle works for any two vectors of hypercontractive random variables (x_{1}, . . . , x_{n} ), (Y_{1}, . . . ,Y_{n} ) such that (i) Matching moments: X_{i} and Y_{i} have matching first and second moments and (ii) Independence: the variablesx_{1}, . . . , x_{n} are independent, as are Y_{1}, . . . ,Y_{n}. The independence condition is crucial to the proof of the theorem, yet in some cases we would like to use distributions (x_{1}, . . . , x_{n} ) in which the individual coordinates are not independent. A common example is the uniform distribution on the slice(^{[n]} _{k} which consists of all vectors (x_{1}, . . . , x_{n} ) ∈ {0, 1}^{n} with Hamming weight k. The slice shows up in theoretical computer science (hardness amplification, direct sum testing), extremal combinatorics (Erdös-Ko-Rado theorems), and coding theory (in the guise of the Johnson association scheme). Our main result is an invariance principle in which (X_{1}, . . . ,X_{n} ) is the uniform distribution on a slice(^{[n]} _{pn}) and (Y_{1}, . . . ,Y_{n} ) consists either of n independent Ber(p) random variables, or of n independent N(p,p(1 - p)) random variables. As applications, we prove a version of Majority is Stablest for functions on the slice, a version of Bourgain's tail theorem, a version of the Kindler-Safra structural theorem, and a stability version of the t-intersecting Erdös-Ko-Rado theorem, combining techniques of Wilson and Friedgut. Our proof relies on a combination of ideas from analysis and probability, algebra, and combinatorics. In particular, we make essential use of recent work of the first author which describes an explicit Fourier basis for the slice.

Original language | American English |
---|---|

Article number | 11 |

Journal | ACM Transactions on Computation Theory |

Volume | 10 |

Issue number | 3 |

DOIs | |

State | Published - Jun 2018 |

### Bibliographical note

Publisher Copyright:© 2018 ACM.

## Keywords

- Analysis of Boolean functions
- Invariance principle
- Johnson scheme
- Slice