Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-08T22:41:13.999Z Has data issue: false hasContentIssue false

Improved bounds for five-term arithmetic progressions

Published online by Cambridge University Press:  27 November 2024

JAMES LENG
Affiliation:
Department of Mathematics, UCLA, Los Angeles, CA 90095, USA. e-mail: James.leng@math.ucla.edu
ASHWIN SAH
Affiliation:
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA. e-mails: asah@mit.edu, msawhney@mit.edu
MEHTAAB SAWHNEY
Affiliation:
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA. e-mails: asah@mit.edu, msawhney@mit.edu
Rights & Permissions [Opens in a new window]

Abstract

Let $r_5(N)$ be the largest cardinality of a set in $\{1,\ldots,N\}$ which does not contain 5 elements in arithmetic progression. Then there exists a constant $c\in (0,1)$ such that

\[r_5(N)\ll \frac{N}{\exp\!((\!\log\log N)^{c})}.\]
Our work is a consequence of recent improved bounds on the $U^4$-inverse theorem of J. Leng and the fact that 3-step nilsequences may be approximated by locally cubic functions on shifted Bohr sets. This, combined with the density increment strategy of Heath–Brown and Szemerédi, codified by Green and Tao, gives the desired result.

MSC classification

Information

Type
Research Article
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of Cambridge Philosophical Society