Erdős Problem #869 — Minimal bases in unions of asymptotic bases
Let be disjoint asymptotic additive bases of order : for each there is a threshold such that every integer belongs to , where . Set . Must contain a minimal asymptotic additive basis of order ? Precisely, is there a set such that contains every sufficiently large integer and, for every , deleting leaves infinitely many integers unrepresented? Erdős Problems #869 Three Questions of Erdős-Nathanson on Asymptotic Bases of Order 2, arXiv:2603.03472
Erdős Problems #869 Three Questions of Erdős-Nathanson on Asymptotic Bases of Order 2, arXiv:2603.03472
Background
Erdős and Nathanson posed this question about whether decomposability forces the existence of a minimal basis. The issue is not whether the union remains a basis—it does, since each of its two parts is already a basis—but whether it contains a subbasis that becomes a nonbasis upon deletion of any one of its elements. Earlier, Härtter and Nathanson had shown that there are additive bases containing no minimal additive basis, so the extra hypothesis of a decomposition into two bases is substantial. Erdős Problems #869
A related measure of abundance is the representation function , the number of representations with and . The question sits among three properties of an asymptotic basis: , being a union of two disjoint asymptotic bases, and containing a minimal asymptotic basis. The first two express forms of abundance or robustness, while minimality is an opposing, element-essential property. Three Questions of Erdős-Nathanson on Asymptotic Bases of Order 2, arXiv:2603.03472
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
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.