Quantitative bounds in a popular polynomial Szemer\'edi theorem
Abstract
We obtain polylogarithmic bounds in the polynomial Szemer\'edi theorem when the polynomials have distinct degrees and zero constant terms. Specifically, let P1, …, Pm ∈ Z[y] be polynomials with distinct degrees, each having zero constant term. Then there exists a constant c = c(P1,…,Pm) > 0 such that any subset A ⊂ \1,2,…,N\ of density at least ( N)-c contains a nontrivial polynomial progression of the form x, x+P1(y), …, x+Pm(y). In addition, we prove an effective ``popular'' version, showing that every dense subset A has some non-zero y such that the number of polynomial progressions in A with this difference y is asymptotically at least as large as in a random set of the same density as A.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.