Personal tools
 

Fourier Analytic Methods in Additive Combinatorics

— filed under:

Paul Koester, Wash. Univ. St. Louis

What
  • Analysis Seminar
When Tue, Oct 17, 2006
from 02:10 PM to 03:00 PM
Where RH 316
Add event to calendar vCal
iCal

Abstract: Additive combinatorics is that branch of number theory concerned with finding arithmetic patterns in sets of integers. A beautiful example of a result in this subject is the Green-Tao theorem, that the prime numbers contain arbitrarily long sequences whose consectutive differences are all the same. While the statements of the theorems in additive combinatorics have a very strong number theory flavor, the proofs typically require tools from many subjects. One of the most fruitful tools is the discrete Fourier transform. In this talk, we will survey some of the basic results in additive combinatorics, emphasizing the role of Fourier analytic methods.

« December 2017 »
December
SuMoTuWeThFrSa
12
3456789
10111213141516
17181920212223
24252627282930
31