Some properties of lower level-sets of convolutions

preprint2012arXivOpen access

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.