Erdős Problem #868 — Minimal Additive Bases with Many Representations
Let denote the positive integers. For and , define the ordered representation count
Call an asymptotic additive basis of order if there is an such that every integer has a representation as a sum of two elements of . Is it true that, for every such satisfying as , there is a subset that is itself an asymptotic additive basis of order and satisfies
Erdős Problems #868 Robust additive bases without minimal subbases (preprint)
Background
The question, attributed to Erdős and Nathanson, asks whether abundant representations allow one to thin a basis while retaining a basis in which every element is essential. These are distinct properties: representation counts measure how many ways integers are covered by the original set, whereas minimality requires that deleting any one element destroys coverage of infinitely many integers. Earlier work of Härtter and Nathanson established that additive bases need not contain any minimal additive basis, so the additional representation hypothesis is consequential. Erdős Problems #868
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.