University of Cambridge > Talks.cam > Discrete Analysis Seminar > A probabilistic approach to almost-periodicity in additive combinatorics

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

A probabilistic approach to almost-periodicity in additive combinatorics

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Boris Bukh.

Certain interesting results in additive combinatorics, such as the existence of long arithmetic progressions in sumsets and Roth’s theorem, can be viewed as consequences of certain almost-periodicity-type theorems for convolutions. I shall discuss this and outline a new technique for establishing such results that uses probability rather than Fourier analysis as the main tool. Based on work joint with Ernie Croot.

This talk is part of the Discrete Analysis Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Enterprisers Modelling Biology Automating Biology using Robot Scientists

Other talks

Autumn Cactus and Succulent Show Gaudier-Brzeska and the Birth of Modern Sculpture IET Prestige Lecture - Bloodhound SSC TBC Quantum Computing, Entanglement and Other Surprises After Independence: India and Pakistan
 

© 2006-2009 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity