zbMATH — the first resource for mathematics

On sum-intersective sets. (English) Zbl 0709.11013
A set H of integers is called sum-intersective if for every set A of positive upper density the equation \(a+a'=h\) has a solution with \(a,a'\in A\), \(h\in H\). “Natural” sets do not have this property, since such a set must intersect every arithmetic progression of even numbers. Probabilistic arguments show the existence of a sum-intersective set satisfying \(H(x)=\sum_{h\in H,h\leq x}1\ll (\log x)^{2+\epsilon}\) [the reviewer, Astérisque 147/148, 173-182 (1986; Zbl 0625.10046)], but constructions had more than \(x^ c\) elements. In this paper the following thinner construction is given. Let \[ H=\{mp^ k :\;m\leq p,k\geq 0.2 (\log p)^{1/3}(\log \log p)^{-2/3}\}, \] where p runs over prime numbers. This set, whose counting function is \[ H(x)<\exp c(\log x)^{3/4}(\log \log x)^{1/2}, \] is proved to be sum-intersective. The proof is based on the Hardy-Littlewood-Vinogradov method.
Reviewer: I.Z.Ruzsa
11B13 Additive bases, including sumsets
11P32 Goldbach-type theorems; other additive questions involving primes
11P55 Applications of the Hardy-Littlewood method
11B34 Representation functions
Full Text: DOI
[1] A. Balog and A. Sárközy, On sums of sequences of integers. III.Acta Math. Hung.,44 (1984), 339–349. · doi:10.1007/BF01950288
[2] I. Z. Ruzsa, Sets of sums and differences,Séminaire de Théorie des Nombres (Paris, 1982/83), 267–273.
[3] I. Z. Ruzsa, Probabilistic constructions in additive number theory,Société Mathématique de Frace, Astérisque, 147–148 (1987), 173–182.
[4] A. Sárközy and C. L. Stewart, to appear.
[5] I. M. Vinogradov,The method of trigonometrical sums in the theory of numbers (New York, 1954). · Zbl 0055.27504
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.