Simultaneous Polynomial Recurrence
Abstract
Let A⊂eq\1,...,N\ and P1,...,P∈[n] with Pi(0)=0 and Pi=k for every 1≤ i≤. We show, using Fourier analytic techniques, that for every >0, there necessarily exists n∈ such that \[|A (A+Pi(n))|N>(|A|N)2-\] holds simultaneously for 1≤ i≤ (in other words all of the polynomial shifts of the set A intersect A "-optimally"), as long as N≥ N1(,P1,...,P). The quantitative bounds obtained for N1 are explicit but poor; we establish that N1 may be taken to be a constant (depending only on P1,...,P) times a tower of 2's of height Ck,*+C-2.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.