Erdős–Tetali theorem

In additive number theory, an area of mathematics, the Erdős–Tetali theorem is an existence theorem concerning economical additive bases of every order. More specifically, it states that for every fixed integer , there exists a subset of the natural numbers satisfying

where denotes the number of ways that a natural number n can be expressed as the sum of h elements of B.

The theorem is named after Paul Erdős and Prasad V. Tetali, who published it in 1990.

Motivation

The original motivation for this result is attributed to a problem posed by S. Sidon in 1932 on economical bases. An additive basis is called economical[1] (or sometimes thin[2]) when it is an additive basis of order h and

that is, for every . In other words, these are additive bases that use as few numbers as possible to represent a given n, and yet represent every natural number. Related concepts include -sequences[3] and the Erdős–Turán conjecture on additive bases.

Sidon's question was whether an economical basis of order 2 exists. A positive answer was given by P. Erdős in 1956,[4] settling the yet-to-be-called Erdős–Tetali theorem for the case . Although the general version was believed to be true, no complete proof appeared in the literature before the paper from Erdős & Tetali (1990).[5]

Ideas in the proof

The proof is an instance of the probabilistic method, and can be divided into three main steps. First, one start by defining a random sequence by

where is some large real constant, is a fixed integer and n is sufficiently large so that the above formula is well-defined. A detailed discussion on the probability space associated with this type of construction may be found on Halberstam & Roth (1983).[6] Secondly, one then shows that the expected value of the random variable has the order of log. That is,

Finally, one shows that almost surely concentrates around its mean. More explicitly:

This is the critical step of the proof. Originally it was dealt with by means of Janson's inequality, a type of concentration inequality for multivariate polynomials. Tao & Vu (2006)[7] present this proof with a more sophisticated two-sided concentration inequality by V. Vu (2000),[8] thus relatively simplifying this step. Alon & Spencer (2016) classify this proof as an instance of the Poisson paradigm.[9]

Further developments

Growth rates other than log

A natural question is whether similar results apply for functions other than log. That is, fixing an integer , for which functions f can we find a subset of the natural numbers satisfying ? It follows from a result of C. Táfula (2018)[10] that if f is a locally integrable, positive real function satisfying

  • , and
  • for some ,

then there exists an additive basis of order h which satisfies . While improvements to the upper bound for f can be reasonably expected (e.g. it is unclear whether the is necessary), any improvements to the lower bound would produce a counterexample to the strong version of Erdős–Turán (see below for details).

Computable economical bases

All the known proofs of Erdős–Tetali theorem are, by the nature of the infinite probability space used, non-constructive proofs. However, Kolountzakis (1995)[11] showed the existence of a recursive set satisfying such that takes polynomial time in n to be computed. The question for remains open.

Economical subbases

Given an arbitrary additive basis , one can ask whether there exists such that is an economical basis. V. Vu (2000)[12] showed that this is the case for Waring bases , where for every fixed k there are economical subbases of of order for every , for some large computable constant .

Strong form of Erdős–Turán conjecture on additive bases

The original Erdős–Turán conjecture on additive bases states, in its most general form, that if is an additive basis of order h then . Nonetheless, in his 1956 paper on the case of Erdős–Tetali, P. Erdős asked whether it could be the case that actually whenever is an additive basis of order 2. The question naturally extends to , making it a way stronger assertion than that of Erdős–Turán. In some sense, what is being conjectured is that there are no additive bases substantially more economical than those guaranteed to exist by the Erdős–Tetali theorem.

gollark: They're generally very hard to find in good ones.
gollark: Those who find collisions in hash functions cannot be trusted.
gollark: That is the wrong way.
gollark: What?
gollark: I'm sure you'd like to think of them as different.

See also

  • Erdős–Fuchs theorem: For any non-zero , there is no set which satisfies .
  • Erdős–Turán conjecture on additive bases: If is an additive basis of order 2, then .
  • Waring's problem, the problem of representing numbers as sums of k-powers, for fixed .

References

  1. As in Halberstam & Roth (1983), p. 111.
  2. As in Tao & Vu (2006), p. 13.
  3. See Definition 3 (p. 3) of O'Bryant, K. (2004), "A complete annotated bibliography of work related to Sidon sequences" (PDF), Electronic Journal of Combinatorics, 11: 39.
  4. Erdős, P. (1956). "Problems and results in additive number theory". Colloque Sur le Theorie des Nombres: 127–137.
  5. p. 264 of Erdős & Tetali (1990).
  6. See Theorem 1 of Chapter III.
  7. Section 1.8 of Tao & Vu (2006).
  8. Vu, Van H. (2000-07-01). "On the concentration of multivariate polynomials with small expectation". Random Structures & Algorithms. 16 (4): 344–363. CiteSeerX 10.1.1.116.1310. doi:10.1002/1098-2418(200007)16:4<344::aid-rsa4>3.0.co;2-5. ISSN 1098-2418.
  9. Chapter 8, p. 139 of Alon & Spencer (2016).
  10. Táfula, Christian (2019). "An extension of the Erdős-Tetali theorem". Random Structures & Algorithms. 0: 173–214. arXiv:1807.10200. doi:10.1002/rsa.20812. ISSN 1098-2418.
  11. Kolountzakis, Mihail N. (1995-10-13). "An effective additive basis for the integers". Discrete Mathematics. 145 (1): 307–313. doi:10.1016/0012-365X(94)00044-J.
  12. Vu, Van H. (2000-10-15). "On a refinement of Waring's problem". Duke Mathematical Journal. 105 (1): 107–134. CiteSeerX 10.1.1.140.3008. doi:10.1215/s0012-7094-00-10516-9. ISSN 0012-7094.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.