University of Cambridge > Talks.cam > Discrete Analysis Seminar > Refined Structure Theorems in Additive Combinatorics

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Refined Structure Theorems in Additive Combinatorics

Download to your calendar using vCal

If you have a question about this talk, please contact Ben Green .

The talk won’t really be on my own work: I wanted to talk about some of Konyagin’s bounds in Freiman’s theorem, structure theorems of Schoen and Shkredov, and the structure theorem of Bateman and Katz. I wanted to keep the title general to leave me with some flexibility but the aim is to explain more clearly how some (but probably not all) of these results work because I have not found it easy to follow any of the arguments in their original form.

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://eng-cam.zoom.us/j/84495932262?pwd=MlFJL3Z3c1JmenFOY2xJQTNPSzdsQT09 Wolfson Lecture Theatre & ONLINE - Details to be sent by email Yusuf Hamied Theatre, Christ's College Cambridge

Other talks

Title to be confirmed The LMC-SMC System: A New Laboratory for Galaxy Evolution, Dynamics and Dark Matter Machine Learning for Spectral Geometry and Vice Versa Group Presentation 2 Title to be confirmed Title to be confirmed
 

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