Hostname: page-component-7b7567c8c-jswmv Total loading time: 0 Render date: 2026-11-15T23:25:35.699Z Has data issue: false hasContentIssue false

Bounds for sets with no polynomial progressions

Published online by Cambridge University Press:  05 January 2021

Sarah Peluse*
Affiliation:
School of Mathematics, Institute for Advanced Study, 1 Einstein Drive, Princeton, NJ 08540, USA; E-mail: speluse@princeton.edu

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let $P_1,\dots ,P_m\in \mathbb{Z} [y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset A of $\{1,\dots ,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots ,x+P_m(y)$ has size $|A|\ll N/(\log \log {N})^{c_{P_1,\dots ,P_m}}$. Along the way, we prove a general result controlling weighted counts of polynomial progressions by Gowers norms.

Information

Type
Number Theory
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2020. Published by Cambridge University Press