Finite addition theorems. I (Q1121319): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: András Sárközy / rank
Normal rank
 
Property / author
 
Property / author: András Sárközy / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on the Densities of Sets of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Representation of Integers as Sums of Distinct Terms from a Fixed Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abschätzung der asymptotischen Dichte von Summenmengen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the fundamental theorem on the density of sums of sets of positive integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of integers containing k elements in arithmetic progression / rank
 
Normal rank

Latest revision as of 14:33, 19 June 2024

scientific article
Language Label Description Also known as
English
Finite addition theorems. I
scientific article

    Statements

    Finite addition theorems. I (English)
    0 references
    1989
    0 references
    The author proves that, given natural numbers N, k and a set \(A\subseteq \{1,2,...,N\}\) with \(| A| \geq (N/k)+1\), there exist integers d,\(\ell,m\); \(1\leq d<k\); \(1\leq \ell <118k\), such that \(\ell A\) contains the arithmetic progression \(\{(m+i)d|\) \(i=1,...,N\}\). A second theorem shows that, roughly speaking, the factor 118 cannot be replaced by 1.
    0 references
    0 references
    addition of finite sets
    0 references
    Szemerédi's theorem
    0 references
    additive bases
    0 references
    arithmetic progression
    0 references
    0 references

    Identifiers