English

Some properties of lower level-sets of convolutions

Combinatorics 2012-02-23 v4

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 {xZN:1A1A(x)γN}\{x \in \Z_N : 1_A*1_A(x) \leq \gamma N\} or of the form {xZN:1A1A(x)<γN}\{x \in \Z_N : 1_A*1_A(x) < \gamma N\}, where AA is a subset of ZN\Z_N. One result we prove using this lemma is that if A=θN|A| = \theta N and A+A(1\eps)N|A+A| \leq (1-\eps) N, 0<\eps<10 < \eps < 1, then this level-set contains an arithmetic progression of length at least NcN^c, c=c(θ,\eps,γ)>0c = c(\theta, \eps,\gamma) > 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 cc and the parameters θ\theta and \eps\eps. 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.

Keywords

Cite

@article{arxiv.1108.1578,
  title  = {Some properties of lower level-sets of convolutions},
  author = {Ernie Croot},
  journal= {arXiv preprint arXiv:1108.1578},
  year   = {2012}
}

Comments

20 pages; minor correction in statement of Theorems 3 and 4. Final pre-publication version