English

On product of difference sets for sets of positive density

Dynamical Systems 2017-02-15 v2 Combinatorics Number Theory

Abstract

In this paper we prove that given two sets E1,E2ZE_1,E_2 \subset \mathbb{Z} of positive density, there exists k1k \geq 1 which is bounded by a number depending only on the densities of E1E_1 and E2E_2 such that kZ(E1E1)(E2E2)k\mathbb{Z} \subset (E_1-E_1)\cdot(E_2-E_2). As a corollary of the main theorem we deduce that if α,β>0\alpha,\beta > 0 then there exist N0N_0 and d0d_0 which depend only on α\alpha and β\beta such that for every NN0N \geq N_0 and E1,E2ZNE_1,E_2 \subset \mathbb{Z}_N with E1αN,E2βN|E_1| \geq \alpha N, |E_2| \geq \beta N there exists dd0d \leq d_0 a divisor of NN satisfying dZN(E1E1)(E2E2)d \, \mathbb{Z}_N \subset (E_1-E_1)\cdot(E_2-E_2).

Keywords

Cite

@article{arxiv.1702.02544,
  title  = {On product of difference sets for sets of positive density},
  author = {Alexander Fish},
  journal= {arXiv preprint arXiv:1702.02544},
  year   = {2017}
}

Comments

6 pages; a new proof (due to I. Shkredov) of Lemma 2.1 that does not use Szemeredi's theorem has been added