
Let N be the set of all nonnegative integers. For a set A⊆N, let R(A,n) denote the number of solutions (a,a′) of a+a′=n with a,a′∈A. The well known Erdős–Turán conjecture says that if R(A,n)⩾1 for all integers n⩾0, then R(A,n) is unbounded. In this Note, the following result is proved: There is a set A⊆N such that R(A,n)⩾1 for all integers n⩾0 and the set of n with R(A,n)=2 has density one.
Arithmetic combinatorics; higher degree uniformity
Arithmetic combinatorics; higher degree uniformity
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 10 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
