← All problems

Erdős Problem #880 — Bounded gaps between restricted sums from an asymptotic basis

28 years old · traced to

Let k≥1k\ge 1 be an integer and let A={a1<a2<⋯ }A=\{a_1<a_2<\cdots\} be a sequence of positive integers such that every sufficiently large positive integer is a sum of at most kk elements of AA, with repetition allowed. Equivalently, writing jAjA for sums of jj elements, not necessarily distinct, and 0A={0}0A=\{0\}, assume

⋃j=0kjA∼N>0,\bigcup_{j=0}^{k} jA \sim \mathbb{N}_{>0},

where X∼N>0X\sim\mathbb{N}_{>0} means that XX contains all but finitely many positive integers. Define the set of sums using distinct elements by

Bk(A)=⋃j=1kj×A,B_k(A)=\bigcup_{j=1}^{k} j\times A,

where j×Aj\times A consists of sums of jj pairwise distinct elements of AA. In increasing order, write Bk(A)={b1<b2<⋯ }B_k(A)=\{b_1<b_2<\cdots\}. Must every such AA satisfy

lim sup⁡n→∞(bn+1−bn)<∞?\limsup_{n\to\infty}(b_{n+1}-b_n)<\infty?

Hegyvári, Hennecart, and Plagne (2007) Erdős Problem #880

Background

The question originated with Burr and Erdős and was published by Erdős among his new and almost-new problems in combinatorial number theory. Its issue is the contrast between unrestricted addition, where an element may be used more than once, and restricted addition, where each summand must be different. In the paper’s notation, jAjA denotes the unrestricted sums and j×Aj\times A the pairwise-distinct sums; the question asks whether eventual coverage by unrestricted sums forces bounded gaps in the union of the restricted sums up to the same number of terms. Hegyvári, Hennecart, and Plagne (2007) Erdős (1998)

References

N. Hegyvári, F. Hennecart, and A. Plagne, Answer to a question by Burr and Erdős on restricted addition, and related results, Combinatorics, Probability and Computing 16 (2007), 747–756.

Source: N. Hegyvári, F. Hennecart, and A. Plagne, Answer to a question by Burr and Erdős on restricted addition, and related results, Combinatorics, Probability and Computing 16 (2007), 747–756.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.