University of Cambridge > Talks.cam > Number Theory Seminar > Finding three-term arithmetic progressions in dense sets of integers

  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

Finding three-term arithmetic progressions in dense sets of integers

Download to your calendar using vCal

  • UserThomas Bloom (Cambridge)
  • ClockTuesday 22 January 2019, 14:30-15:30
  • HouseMR13.

If you have a question about this talk, please contact Beth Romano .

One of the most famous theorems in arithmetic combinatorics is Roth’s theorem: any dense set of integers contains infinitely many non-trivial three-term arithmetic progressions. Since its first proof in 1953, a great deal of effort has gone into improving the quantitative bounds. I will give an overview of the methods used, the history of the bounds obtained, and the current state of the art.

This talk is part of the Number Theory Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Seminar Room, Henry Wellcome Building & on Zoom -https://zoom.us/meeting/register/tJEkcuCtrTwoG9I1M856dIPOpwYUO3q4WdIv Single Cell seminars at the Wellcome Genome Campus Online on Teams

Other talks

César Milstein Lecture - Title TBC Unveiling the curtain with ukubuyisa or go lata: complicated roles of museums and nation states in the cultural repatriation discourse and practice in southern Africa Title TBC Title TBC Proteomics: Expression Analysis and Subcellular Localisation Cooperation for Nature
 

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