Forbidden intersections for codes.

Determining the maximum size of a t$t$‐intersecting code in [m]n$[m]^n$ was a longstanding open problem of Frankl and Füredi, solved independently by Ahlswede and Khachatrian and by Frankl and Tokushige. We extend their result to the setting of forbidden intersections, by showing that for any m>2$m>2$ and n$n$ large compared with t$t$ (but not necessarily m$m$) that the same bound holds for codes with the weaker property of being (t−1)$(t-1)$‐avoiding, that is, having no two vectors that agree on exactly t−1$t-1$ coordinates. Our proof proceeds via a junta approximation result of independent interest, which we prove via a development of our recent theory of global hypercontractivity: we show that any (t−1)$(t-1)$‐avoiding code is approximately contained in a t$t$‐intersecting junta (a code where membership is determined by a constant number of coordinates). In particular, when t=1$t=1$, this gives an alternative proof of a recent result of Eberhard, Kahn, Narayanan and Spirkl that symmetric intersecting codes in [m]n$[m]^n$ have size o(mn)$o(m^n)$. [ABSTRACT FROM AUTHOR]