![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Thursday 22 June 2023, 17:00-18:00
Roth numbers: Upper, lower bounds, and related constructions
⚠️ Important: Note: different room, MR20 this time
- 👤 Speaker: Yaël Dillies (University of Cambridge)
- 📅 Date & Time: Thursday 22 June 2023, 17:00 - 18:00
- 📍 Venue: MR20 Centre for Mathematical Sciences
Questions? Contact
Angeliki Koutsoukou-Argyraki
Abstract
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.
Series This talk is part of the Formalisation of mathematics with interactive theorem provers series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- CMS Events
- Department of Computer Science and Technology talks and seminars
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths study groups
- Formalisation of mathematics with interactive theorem provers
- Hanchen DaDaDash
- Interested Talks
- Martin's interesting talks
- MR20 Centre for Mathematical Sciences
- School of Physical Sciences
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.