Roth numbers: Upper, lower bounds, and related constructions

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

• Yaël Dillies (University of Cambridge)
• Thursday 22 June 2023, 17:00-18:00
• MR20 Centre for Mathematical Sciences.

If you have a question about this talk, please contact Angeliki Koutsoukou-Argyraki.

Note: different room, MR20 this time

The maximum number of integers between 1 and n that one can take without creating an arithmetic progression of length 3 might sound like a trivial concern. It is in fact a foundational problem in additive combinatorics.

I will explain how we formalised Roth’s upper bound, Behrend’s lower bound and derived the proof to the Ruzsa-Szemerédi. Finally, I will outline how we will attack the brand new upper bound of Kelley and Meka.

All work joint with Bhavik Mehta.

This talk is part of the Formalisation of mathematics with interactive theorem provers series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS Pure Maths study groups
• DPMMS info aggregator
• DPMMS lists
• Department of Computer Science and Technology talks and seminars
• Formalisation of mathematics with interactive theorem provers
• Hanchen DaDaDash
• Interested Talks
• MR20 Centre for Mathematical Sciences
• School of Physical Sciences
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.