Vitaly Bergelson

Source: Wikipedia, the free encyclopedia.
Vitaly Bergelson

Vitaly Bergelson (born 1950 in

Kiev[1]) is a mathematical researcher and professor at Ohio State University in Columbus, Ohio. His research focuses on ergodic theory and combinatorics
.

Bergelson received his Ph.D in 1984 under Hillel Furstenberg at the Hebrew University of Jerusalem.[1] He gave an invited address at the International Congress of Mathematicians in 2006 in Madrid.[2] Among Bergelson's best known results is a polynomial generalization of Szemerédi's theorem.[3] The latter provided a positive solution to the famous Erdős–Turán conjecture from 1936 stating that any set of integers of positive upper density contains arbitrarily long arithmetic progressions. In a 1996 paper Bergelson and Leibman obtained an analogous statement for "polynomial progressions".[4] The Bergelson-Leibman theorem[1] and the techniques developed in its proof spurred significant further applications and generalizations, particularly in the recent work of Terence Tao.[5][6]

In 2012 he became a fellow of the American Mathematical Society.[7]

References

  1. ^ ; p. 358
  2. ^ ICM 2006, Invited Lectures Abstracts, ICM2006.org. Accessed January 23, 2010
  3. Szemerédi, E.
    , On sets of integers containing no k elements in arithmetic progression. Collection of articles in memory of Juriĭ Vladimirovič Linnik. Acta Arithmetica, vol. 27 (1975), pp. 199–245
  4. ^ V. Bergelson, A. Leibman, Polynomial extensions of van der Waerden's and Szemerédi's theorems. Journal of the American Mathematical Society, vol. 9 (1996), no. 3, pp. 725–753
  5. ^ Tao, Terence. A quantitative ergodic theory proof of Szemerédi's theorem. Electronic Journal of Combinatorics, vol. 13 (2006), no. 1
  6. ^ Tao, Terence, and Ziegler, Tamar. The primes contain arbitrarily long polynomial progressions. Acta Mathematica, vol. 201 (2008), no. 2, pp. 213–305
  7. ^ List of Fellows of the American Mathematical Society, retrieved 2012-11-10.

External links