On finite addition theorems

Research output: Article

4 Citations (Scopus)


If a finite set A of integers included in {1 , . . . , N} has more than N/k elements, one may expect that the set ℓA of sums of ℓ elements of A, contains, when ℓ is comparable to k, a rather long arithmetic progression (which can be required to be homogeneous or not). After presenting the state of the art, we show that some of the results cannot be improved as far as it would be thought possible in view of the known results in the infinite case. The paper ends with lower and upper bounds for the order, as asymptotic bases, of the subsequences of the primes which have a positive relative density.

Original languageEnglish
Pages (from-to)109-127
Number of pages19
Publication statusPublished - dec. 1 1999

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'On finite addition theorems'. Together they form a unique fingerprint.

  • Cite this