## Abstract

A family of permutations F ⊂ S_{n} is said to be t -intersecting if any two permutations in F agree on at least t points. It is said to be .t − 1/-intersection-free if no two permutations in F agree on exactly t − 1 points. If S; T ⊂ ^{1}1; 2;:::; nºwith jS j D jT j, and π W S → T is a bijection, then the π -star in S_{n} is the family of all permutations that agree with π on S . An s-star is a π-star such that π is a bijection between sets of size s. Friedgut and Pilpel, and independently the first author, showed that if F ⊂ S_{n} is t -intersecting, and n is sufficiently large depending on t , then jF j ≤ .n − t /Š; this proved a conjecture of Deza and Frankl from 1977. Here, we prove a considerable strengthening of the Deza–Frankl conjecture, namely, that if n is sufficiently large depending on t , and F ⊂ S_{n} is .t − 1/-intersection-free, then jF j ≤ .n − t /Š, with equality iff F is a t -star. The main ingredient of our proof is a “junta approximation” result, namely, that any .t − 1/-intersection-free family of permutations is essentially contained in a t - intersecting junta (a “junta” being a union of boundedly many O.1/-stars). The proof of our junta approximation result relies, in turn, on (i) a weak regularity lemma for families of permutations (which outputs a junta whose stars are intersected by F in a weakly pseudorandom way), (ii) a combinatorial argument that “bootstraps” the weak notion of pseudorandomness into a stronger one, and finally (iii) a spectral argument for highly pseudorandom fractional families. Our proof employs four different notions of pseudorandomness, three being combinatorial in nature and one being algebraic. The connection we demonstrate between these notions of pseudorandomness may find further applications.

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

Pages (from-to) | 1417-1467 |

Number of pages | 51 |

Journal | Duke Mathematical Journal |

Volume | 171 |

Issue number | 7 |

DOIs | |

State | Published - 2022 |

### Bibliographical note

Publisher Copyright:© 2022 Duke University Press. All rights reserved.