Some properties of lower level-sets of convolutions

Abstract

In the present paper we prove a certain lemma about the structure of "lower level-sets of convolutions", which are sets of the form \x ∈ N : 1A*1A(x) ≤ γ N\ or of the form \x ∈ N : 1A*1A(x) < γ N\, where A is a subset of N. One result we prove using this lemma is that if |A| = θ N and |A+A| ≤ (1-) N, 0 < < 1, then this level-set contains an arithmetic progression of length at least Nc, c = c(θ, ,γ) > 0. It is perhaps possible to obtain such a result using Green's arithmetic regularity lemma (in combination with some ideas of Bourgain); however, our method of proof allows us to obtain non-tower-type quantitative dependence between the constant c and the parameters θ and . For various reasons (discussed in the paper) one might think, wrongly, that such results would only be possible for level-sets involving triple and higher convolutions.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…