#
Patterns without a popular difference

- Department of Mathematics
- MIT
- More about Ashwin Sah

- Department of Mathematics
- MIT
- More about Mehtaab Sawhney

- Department of Mathematics
- MIT
- More about Yufei Zhao

### Editorial introduction

Patterns without a popular difference, Discrete Analysis 2021:8, 30 pp.

Szemerédi’s theorem states that for every δ>0 and every positive integer k there exists N such that every subset A⊂[N] of size at least δN contains an arithmetic progression of length k. From this theorem one can deduce by an averaging argument (first observed by Varnavides) that there exists a constant c=c(δ,k)>0 such that for every N the number of arithmetic progressions in a subset of N of size at least δN must be at least cN2. (For convenience, so that the result is true for all N rather than just for all sufficiently large N, we include degenerate arithmetic progressions, that is, progressions for which the common difference is zero.)

A simple observation that is very useful for guiding intuition is that if A is a set of size δN chosen randomly, then the number of arithmetic progressions of length k is with high probability approximately equal to δk times the total number of progressions of length k in [N], and indeed that for each d>0 (provided it is not too close to N/(k−1)) the same is true of the number of progressions of common difference d.

If d is such that the number of progressions in A of length k and common difference d is at least (δk−o(1))|A|, then we can call it a *popular common difference*. With the help of the arithmetic regularity lemma that he had developed, Ben Green proved that when k=3, popular common differences always exist. (As an aside, we note that this led to tower-type bounds, which turned out, very interestingly, to be necessary. See this editorial introduction for more discussion.) With Terence Tao, he later proved the same for k=4, but surprisingly the result is false for k≥5, a counterexample having been discovered by Imre Ruzsa.

This paper considers, and completely answers, the following natural generalization of the question above. For which finite subsets P of Zr is it the case that for every δ>0 and every A⊂[N]r there exists some d≠0 such that the number of translates of d⋅P that lie inside A is at least (δ|P|−o(1))Nr? (Here d⋅P denotes the dilate of P by a factor d.) The answer turns out to be that the only examples are subsets of Z of size 3 and subsets of Z of size 4 such that the sum of two elements is equal to the sum of the other two. That these are examples follows from the proofs of Green, and Green and Tao, so the short answer is that there are no further examples. Thanks to previous work, it was already known that any example would have to have size 4 and be a subset of Z or Z2.

There is, however, a further distinction that can be drawn. For some configurations P one can at least prove that there is a constant C such that there is a difference d such that the number of translates of d⋅P is at least δCNr, and for others it can be proved that there is no such constant. Amongst other results, the authors show that there are configurations of size 4 in Z2 for which there is no power-type lower bound, and that for every C there is a subset P of Z of size 4 and a set A⊂[N] such that the number of translates of d⋅P inside A is at most δCN for every d>0.

The work of this paper also has a bearing on another problem that has been open for some time. Let A be a subset of Z/NZ that is uniform, in the sense that all its non-trivial Fourier coefficients are small. Timothy Gowers gave examples of such sets A of size δN such that A4 contains at most αN2 quadruples of the form (x,x+y,x+2y,x+3y), with α strictly less than δ4. However, it is unknown whether α can be taken to be δC for an arbitrarily large C. The example just mentioned shows that for every C there is a configuration P of size 4 and a Fourier-uniform set that gives rise to an upper bound of δC.