← All problems

Erdős Problem #868 — Minimal Additive Bases with Many Representations

1 year old · traced to

Let N\mathbb N denote the positive integers. For A⊆NA\subseteq\mathbb N and n∈Nn\in\mathbb N, define the ordered representation count

rA,2(n)=#{(a0,a1)∈A2:a0+a1=n}.r_{A,2}(n)=\#\{(a_0,a_1)\in A^2:a_0+a_1=n\}.

Call AA an asymptotic additive basis of order 22 if there is an n0n_0 such that every integer n>n0n>n_0 has a representation as a sum of two elements of AA. Is it true that, for every such AA satisfying rA,2(n)→∞r_{A,2}(n)\to\infty as n→∞n\to\infty, there is a subset B⊆AB\subseteq A that is itself an asymptotic additive basis of order 22 and satisfies

∀b∈B,B∖{b} is not an asymptotic additive basis of order 2?\forall b\in B,\qquad B\setminus\{b\}\text{ is not an asymptotic additive basis of order }2?

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

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.