Erdős Problem #880 — Bounded gaps between restricted sums from an asymptotic basis
Let be an integer and let be a sequence of positive integers such that every sufficiently large positive integer is a sum of at most elements of , with repetition allowed. Equivalently, writing for sums of elements, not necessarily distinct, and , assume
where means that contains all but finitely many positive integers. Define the set of sums using distinct elements by
where consists of sums of pairwise distinct elements of . In increasing order, write . Must every such satisfy
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, denotes the unrestricted sums and 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.
Progress summary
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.