← All problems

Erdős Problem #881 — Removable subsets of minimal asymptotic bases

28 years old · traced to

For a set AA of positive integers and a positive integer jj, write

jA={a1+⋯+aj:a1,…,aj∈A},jA=\{a_1+\cdots+a_j:a_1,\ldots,a_j\in A\},

allowing repeated summands. Say that AA is an asymptotic basis of order jj if there is an integer n0n_0 such that every integer n≥n0n\ge n_0 belongs to jAjA. The question is whether, for every positive integer kk and every asymptotic basis AA of order kk satisfying

for every infinite B⊆A,A∖B is not an asymptotic basis of order k,\text{for every infinite }B\subseteq A,\qquad A\setminus B\text{ is not an asymptotic basis of order }k,

there is an infinite B⊆AB\subseteq A for which A∖BA\setminus B is an asymptotic basis of order k+1k+1. 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 kk 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 “ℵ0\aleph_0-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

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.