2000 character limit reached
Bounds for sets with no polynomial progressions
Published 1 Sep 2019 in math.NT and math.CO | (1909.00309v4)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.