Erdős–Fuchs conjecture on additive representation functions

Let A={a1,a2,}\mathcal{A} = \{a_{1}, a_{2},\ldots\} be a set of nonnegative integers satisfying ancn2a_n \leq cn^2 for all nn, where c>0c>0 is a real constant. Let RA(n)R_A(n) denote the number of representations of nn as a sum ai+aja_i+a_j with ai,ajAa_i,a_j\in A and iji\leq j. Erdős–Fuchs conjecture. One has

lim supnRA(n)=.\limsup_{n\to\infty}R_A(n)=\infty.

This conjecture strengthens the Erdős–Turán conjecture, which asserts that an additive basis of order two cannot have a bounded representation function. Its status is not resolved in the supplied source.

Sources & referencesView supporting material

Primary source

Sándor Z. Kiss and Csaba Sándor, “On the maximum values of the additive representation functions”, arXiv:1504.07411 (2015).

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.