Erdős's lower-bound conjecture for representation functions of asymptotic bases

Let h2h\geqslant 2, let S\mathcal{S} be the space of subsets of the nonnegative integers, and for an asymptotic hh-basis AA let rh(n;A)r_h(n;A) denote its representation function. Erdős's conjecture. If ASA\in\mathcal{S} is an asymptotic hh-basis, then

lim supn+rh(n;A)log(n)>0.\limsup_{n\to +\infty} \frac{r_h(n;A)}{\log(n)} > 0.

This is stronger than the Erdős–Turán conjecture because it asserts growth on the scale of log(n)\log(n) rather than merely unboundedness. The source discusses the limitations of probabilistic methods and gives no proof or counterexample.

Sources & referencesView supporting material

Primary source

Christian Táfula, “An elementary heuristic for Hardy-Littlewood extended Goldbach's conjecture”, arXiv:1508.05702 (2019).

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.