- Series
- Combinatorics Seminar
- Time
- Friday, January 31, 2020 - 3:05pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Andrei (Cosmin) Pohoata – California Inst. of Technology, Pasadena, CA – apohoata@caltech.edu
- Organizer
- Prasad Tetali
It is a classical theorem of Roth that every dense subset of {1,…,N} contains a nontrivial three-term arithmetic progression. Quantitatively, results of Sanders, Bloom, and Bloom-Sisask tell us that subsets of relative density at least 1/(logN)1−ϵ already have this property. In this talk, we will discuss some sets of N integers which unlike {1,…,N} do not contain nontrivial four-term arithmetic progressions, but which still have the property that all of their subsets of density at least 1/(logN)1−ϵ must contain a three-term arithmetic progression. Perhaps a bit surprisingly, these sets turn out not to have as many three-term progressions as one might be inclined to guess, so we will also address the question of how many three-term progressions can a four-term progression free set may have. Finally, we will also discuss about some related results over Fnq. Based on joint works with Jacob Fox and Oliver Roche-Newton.