Erdős Problem #881 — Removable subsets of minimal asymptotic bases
For a set of positive integers and a positive integer , write
allowing repeated summands. Say that is an asymptotic basis of order if there is an integer such that every integer belongs to . The question is whether, for every positive integer and every asymptotic basis of order satisfying
there is an infinite for which is an asymptotic basis of order . Erdős Problems, Problem #881
Background
Minimal asymptotic bases arise from asking how much a set can be thinned while retaining its additive covering property. Stöhr introduced the notion of a minimal basis, in the usual sense that no proper subset remains a basis; existence was later established nonconstructively by Härtter and through explicit constructions by Nathanson. The condition in this question is different: it rules out preserving order after deletion of any infinite subset, without requiring that deleting even one element destroys the basis. Erdős and Nathanson, Minimal Asymptotic Bases for the Natural Numbers Erdős and Nathanson, Oscillations of Bases for the Natural Numbers
Erdős listed the question among his problems in combinatorial number theory. A closely related notion in the earlier work of Erdős and Nathanson is an “-minimal” basis: deleting any finite subset leaves a basis, whereas deleting any infinite subset does not. This captures the infinite-deletion condition together with an additional finite-deletion requirement. Erdős (1998), Some of my new and almost new problems in combinatorial number theory Erdős and Nathanson, Oscillations of Bases for the Natural Numbers
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.