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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹī¸ Information

A probabilistic approach to almost-periodicity in additive combinatorics

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

https://www.eventbrite.co.uk/e/industry-lecture-paul-varley-of-kymab-tickets-140964288983 Webinar & FW11, Computer Laboratory, William Gates Building. Judge Business School W2.02

Other talks

Machine Politics? Computers and AI in the History of Political Thought In conversation: Louis Herns Marcelin and Ola Osman on legacies of enslavement and contemporary violence in Liberia and Haiti Title to be confirmed Talk title TBC Using numerical simulations for solving spectral geometry problems CUSCRS and Renal Medicine
 

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