Erdős–Turán conjecture on additive bases

The Erdős–Turán conjecture is an old unsolved problem in additive number theory (not to be confused with Erdős conjecture on arithmetic progressions) posed by Paul Erdős and Pál Turán in 1941.

The question concerns subsets of the natural numbers, typically denoted by $\mathbb{N}$ , called additive bases. A subset $B$ is called an (asymptotic) additive basis of finite order if there is some positive integer $h$ such that every sufficiently large positive integer $n$ can be written as the sum of at most $h$ elements of $B$ . For example, the natural numbers are themselves an additive basis of order 1, since every natural number is trivially a sum of at most one natural number. It is a non-trivial theorem of Lagrange (Lagrange's four-square theorem) that the set of positive square numbers is an additive basis of order 4. Another highly non-trivial and celebrated result along these lines is Vinogradov's theorem.

One is naturally inclined to ask how optimal are these results. It turns out that Lagrange's four-square theorem cannot be improved, as there are infinitely many positive integers which are not the sum of three squares. This is because that no positive integer which is the sum of three squares can leave a remainder of 7 when divided by 8. However, one should perhaps expect that a set $B$ which is about as sparse as the squares (meaning that in a given interval $[1,N]$ , roughly $N^{1/2}$ of the integers in $[1,N]$ lie in $B$ ) which does not have this obvious deficit should have the property that every sufficiently large positive integer is the sum of three elements from $B$ . This follows from the following probabilistic model: suppose that $N/2 < n \leq N$ is a positive integer, and $x_1, x_2, x_3$ are 'randomly' selected from $B \cap [1,N]$ . Then the probability of a given element from $B$ being chosen is roughly $1/N^{1/2}$ . One can then estimate the expected value, which in this case will be quite large. Thus, we `expect' that there are many representations of $n$ as a sum of three elements from $B$ , unless there is some arithmetic obstruction (which means that $B$ is somehow quite different than a `typical' set of the same density), like with the squares. Therefore, one should expect that the squares are quite inefficient at representing positive integers as the sum of four elements, since there should already be lots of representations as sums of three elements for those positive integers $n$ that passed the arithmetic obstruction. Examining Vinogradov's theorem quickly reveals that the primes are also very inefficient at representing positive integers as the sum of four primes, for instance.

This begets the question: suppose that $B$ , unlike the squares or the prime numbers, is very efficient at representing positive integers as a sum of $h$ elements of $B$ . How efficient can it be? The best possibility is that we can find a positive integer $h$ and a set $B$ such that every positive integer $n$ is the sum of at most $h$ elements of $B$ in exactly one way. Failing that, perhaps we can find a $B$ such that every positive integer $n$ is the sum of at most $h$ elements of $B$ in at least one way and at most $S(h)$ ways, where $S$ is a function of $h$ .

This is basically the question that Paul Erdős and Pál Turán asked in 1941. Indeed, they conjectured a negative answer to this question, namely that if $B$ is an additive basis of order $h$ of the natural numbers, then it cannot represent positive integers as a sum of at most $h$ too efficiently; the number of representations of $n$ , as a function of $n$ , must tend to infinity.

History

The conjecture was made jointly by Paul Erdős and Pál Turán in.^[1] In the original paper, they state

"(2) If $f(n) > 0$ for $n > n_0$ , then $\varlimsup_{n \rightarrow \infty} f(n) = \infty$ "

Here $f(n)$ is the number of ways one can write the natural number $n$ as the sum of two (not necessarily distinct) elements of $B$ . If $f(n)$ is always positive for sufficiently large $n$ , then $B$ is called an additive basis (of order 2).^[2] This problem has attracted significant attention^[2] but remains unsolved.

In 1964, Erdős published a multiplicative version of this conjecture. See source :

P. Erdõs: On the multiplicative representation of integers, Israel J. Math. 2 (1964), 251--261

Progress

While the conjecture remains unsolved, there have been some advances on the problem. First, we express the problem in modern language. For a given subset $B \subset \mathbb{N}$ , we define its representation function $r_B(n) = \#\{(a_1, a_2) \in B^2 | a_1 + a_2 = n \}$ . Then the conjecture states that if $r_B(n) > 0$ for all $n$ sufficiently large, then $\limsup_{n \rightarrow \infty} r_B(n) = \infty$ .

More generally, for any $h \in \mathbb{N}$ and subset $B \subset \mathbb{N}$ , we can define the $h$ representation function as $r_{B,h}(n) = \#\{(a_1, \cdots, a_h) \in B^h | a_1 + \cdots + a_h = n \}$ . We say that $B$ is an additive basis of order $h$ if $r_{B,h}(n) > 0$ for all $n$ sufficiently large. One can see from an elementary argument that if $B$ is an additive basis of order $h$ , then

$\displaystyle n \leq \sum_{m=1}^n r_{B,h}(m) \leq |B \cap [1,n]|^h$

So we obtain the lower bound $n^{1/h} \leq |B \cap [1,n]|$ .

The original conjecture spawned as Erdős and Turán sought a partial answer to Sidon's problem (see: Sidon sequence). Later, Erdős set out to answer the following question posed by Sidon: how close to the lower bound $|B \cap [1,n]| \geq n^{1/h}$ can an additive basis $B$ of order $h$ get? This question was answered in the case $h=2$ by Erdős in 1956.^[3] Erdős proved that there exists an additive basis $B$ of order 2 and constants $c_1, c_2 > 0$ such that $c_1 \log n \leq r_B(n) \leq c_2 \log n$ for all $n$ sufficiently large. In particular, this implies that there exists an additive basis $B$ such that $r_B(n) = n^{1/2 + o(1)}$ , which is essentially best possible. This motivated Erdős to make the following conjecture

If $B$ is an additive basis of order $h$ , then $\limsup_{n \rightarrow \infty} r_B(n)/\log n > 0.$

In 1986, Eduard Wirsing proved that a large class of additive bases, including the prime numbers, contains a subset that is an additive basis but significantly thinner than the original.^[4] In 1990, Erdős and Prasad V. Tetali extended Erdős's 1956 result to bases of arbitrary order.^[5] In 2000, V. Vu proved that thin subbases exist in the Waring bases using the Hardy–Littlewood circle method and his polynomial concentration results.^[6] In 2006, Borwein, Choi, and Chu proved that for all additive bases $B$ , $f(n)$ eventually exceeds 7.^[7] ^[8]

References

↑ Erdős, Paul.; Turán, Pál (1941). "On a problem of Sidon in additive number theory, and on some related problems". Journal of the London Mathematical Society 16: 212–216. doi:10.1112/jlms/s1-16.4.212.
1 2 Tao, T.; Vu, V. (2006). Additive Combinatorics. New York: Cambridge University Press. p. 13. ISBN 0-521-85386-9.
↑ Erdős, P. (1956). "Problems and results in additive number theory". Colloque sur le Theorie des Nombres: 127–137.
↑ Wirsing, Eduard (1986). "Thin subbases". Analysis 6: 285–308. doi:10.1524/anly.1986.6.23.285.
↑ Erdős, Paul.; Tetali, Prasad (1990). "Representations of integers as the sum of $k$ terms". Random Structures Algorithms 1 (3): 245–261. doi:10.1002/rsa.3240010302.
↑ Vu, Van (2000). "On a refinement of Waring's problem". Duke Mathematical Journal 105 (1): 107–134. doi:10.1215/S0012-7094-00-10516-9.
↑ Borwein, Peter; Choi, Stephen; Chu, Frank (2006). "An old conjecture of Erdős–Turán on additive bases". Mathematics of Computation 75: 475–484. doi:10.1090/s0025-5718-05-01777-1.
↑ Xiao, Stanley Yao (2011). On the Erdős–Turán conjecture and related results.

This article is issued from Wikipedia - version of the Monday, October 05, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.