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

  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

Improved lower bounds for Szemeredi’s theorem.

Download to your calendar using vCal

  • UserZach Hunter (ETH Zurich)
  • ClockThursday 19 October 2023, 14:30-15:30
  • HouseMR12.

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

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:

Note that ex-directory lists are not shown.

Other lists

Building a Developer Community across the University Cavendish Laboratory, Pippard Lecture Theatre & TEAMS CCMR Events

Other talks

TBC Gastroenterology and Acute Medicine Why people with schizophrenia die earlier? Mortality and accelerated ageing Group Work Title to be confirmed Cambridge RNA Club - ONLINE
 

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