Sidon sequence

In number theory, a Sidon sequence (or Sidon set), named after the Hungarian mathematician Simon Sidon, is a sequence A = {a0, a1, a2, ...} of natural numbers in which all pairwise sums ai + aj (i ≤ j) are different. Sidon introduced the concept in his investigations of Fourier series.

The main problem in the study of Sidon sequences, posed by Sidon,[1] is to find the largest number of elements a Sidon sequence A can have smaller than some given number x. Despite a large body of research,[2] the question remained unsolved for almost 80 years. In 2010, it was finally settled[3] by J. Cilleruelo, I. Ruzsa and C. Vinuesa.

Early results

Paul Erdős and Pál Turán proved that, for every x > 0, the number of elements smaller than x in a Sidon sequence is at most . Using a construction of J. Singer, they showed that there exist Sidon sequences that contain terms less than x.

Infinite Sidon sequences

Erdős also showed that if we consider any particular infinite Sidon sequence A and let A(x) denote the number of its elements up to x, then

.

That is, infinite Sidon sequences are thinner than the densest finite Sidon sequences.

For the other direction, Chowla and Mian observed that the greedy algorithm gives an infinite Sidon sequence with for every x.[4] Ajtai, Komlós, and Szemerédi improved this with a construction[5] of a Sidon sequence with

The best lower bound to date was given by Imre Z. Ruzsa, who proved[6] that a Sidon sequence with

exists. Erdős conjectured that an infinite Sidon set A exists for which holds. He and Rényi showed[7] the existence of a sequence {a0,a1,...} with the conjectural density but satisfying only the weaker property that there is a constant k such that for every natural number n there are at most k solutions of the equation ai + aj = n. (To be a Sidon sequence would require that k = 1.)

Erdős further conjectured that there exists a nonconstant integer-coefficient polynomial whose values at the natural numbers form a Sidon sequence. Specifically, he asked if the set of fifth powers is a Sidon set. Ruzsa came close to this by showing that there is a real number c with 0 < c < 1 such that the range of the function f(x) = x5 + [cx4] is a Sidon sequence, where [.] denotes integer part. As c is irrational, this function f(x) is not a polynomial. The statement that the set of fifth powers is a Sidon set is a special case of the later conjecture of Lander, Parkin and Selfridge.

Relationship to Golomb rulers

All finite Sidon sets are Golomb rulers, and vice versa.

To see this, suppose for a contradiction that S is a Sidon set and not a Golomb ruler. Since it is not a Golomb ruler, there must be four members such that . It follows that , which contradicts the proposition that S is a Sidon set. Therefore all Sidon sets must be Golomb rulers. By a similar argument, all Golomb rulers must be Sidon sets.

See also

References

  1. ↑ Erdős, P.; Turán, P. (1941), "On a problem of Sidon in additive number theory and on some related problems" (PDF), J. London Math. Soc., 16: 212–215, doi:10.1112/jlms/s1-16.4.212. Addendum, 19 (1944), 208.
  2. ↑ O'Bryant, K. (2004), "A complete annotated bibliography of work related to Sidon sequences" (PDF), Electronic Journal of Combinatorics, 11: 39.
  3. ↑ Cilleruelo, J.; Ruzsa, I.; Vinuesa, C. (2010), "Generalized Sidon sets" (PDF), Advances in Mathematics, 225: 2786–2807, doi:10.1016/j.aim.2010.05.010
  4. ↑ Mian, Abdul Majid; Chowla, S. (1944), "On the B2 sequences of Sidon", Proc. Natl. Acad. Sci. India A, 14: 3–4, MR 0014114.
  5. ↑ Ajtai, M.; Komlós, J.; Szemerédi, E. (1981), "A dense infinite Sidon sequence", European Journal of Combinatorics, 2 (1): 1–11, doi:10.1016/s0195-6698(81)80014-5, MR 0611925.
  6. ↑ Ruzsa, I. Z. (1998), "An infinite Sidon sequence", Journal of Number Theory, 68: 63–71, doi:10.1006/jnth.1997.2192, MR 1492889.
  7. ↑ Erdős, P.; Rényi, A. (1960), "Additive properties of random sequences of positive integers" (PDF), Acta Arithmetica, 6: 83–110, MR 0120213.
This article is issued from Wikipedia - version of the 11/16/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.