COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Combinatorics Seminar > Improved lower bounds for Szemeredi’s theorem.

## Improved lower bounds for Szemeredi’s theorem.Add to your list(s) Download to your calendar using vCal - Zach Hunter (ETH Zurich)
- Thursday 19 October 2023, 14:30-15:30
- MR12.
If you have a question about this talk, please contact ibl10. Let $r_k(N)$ denote cardinality of the largest subset of $\{1,…,N\}$ which does not contain an arithmetic progression of length $k$. Since 1961, the best lower bound (up to lower order terms) has been due to Rankin, establishing $r_k(N) \ge N exp(-(c_k+o(1)) \log^{p_k}(N))$ for certain explicit constants $c_k,p_k> 0$, generalizing a construction of Behrend. We shall establish new bounds for this problem, improving the constant $c_k$ for all $k\ge 7$ (with the same value of $p_k$). Our methods also have implications for related problems in finite fields. This talk is part of the Combinatorics Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsTrinity Psychology Society Clare Politics Clinical ID talks## Other talksTBA Nuclear Energy and Net Zero Exploring the Mechanisms of Associative Plasticity within and between Hippocampal Areas CA1 and CA2 Latent variable models: factor analysis and all that The peopling of the Americas: A chronological perspective Single-molecule approaches to exploring a nanomotor dysfunction; Impaired motor function as a trigger to pathological cardiac remodelling in cardiomyopathy |