Representation of elements of a sequence by sumsets (Q1375703)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Representation of elements of a sequence by sumsets |
scientific article; zbMATH DE number 1102611
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Representation of elements of a sequence by sumsets |
scientific article; zbMATH DE number 1102611 |
Statements
Representation of elements of a sequence by sumsets (English)
0 references
11 January 1998
0 references
Let \(A\) be a finite and \(S\) an infinite set of positive integers. Suppose that \(S\) has an element in the interval \([N, 2N]\) for every positive integer \(N\geq N_0 (\geq1)\). In the paper the author shows that there is an integer \(k\), depending on the density of \(A\), such that some elements of \(S\) can be represented by a sum of at most \(k\) elements of \(A\).
0 references
representation
0 references
set of integers
0 references
sum of integers
0 references