Representation of elements of a sequence by sumsets

DOI10.1007/BF01271276MaRDI QIDQ1375703zbMATH OpenFDO

Authors Vsevolod F. Lev

Publication date 11 January 1998

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01271276

zbMATH Keywords

representationset of integerssum of integers

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Other combinatorial number theory (11B75)

Review text

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\).

Recommendations

• Sets whose sumset avoids a thin sequence
• Infinite sumsets with many representations
• On the supremum of the representation function of a sumset
• Optimal representations by sumsets and subset sums
• Sumsets containing infinite arithmetic progressions

Cites work

• Biased random walks
• Optimal representations by sumsets and subset sums
• Structure theorem for multiple addition and the Frobenius problem
• Subset sums

Cited in

(8)

• Representing integers as sums or differences of general power products
• Sets whose sumset avoids a thin sequence
• Complete sequences in \(\mathbb{N}^ 2\)
• Sums of Finite Sets of Integers, II
• On the n-th element of a set of positive integers
• Sumsets containing a term of a sequence
• Optimal result on restricted sumsets containing powers of two
• Residue class ring with identical representation function

This page was built for publication: Representation of elements of a sequence by sumsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1375703)