Polynomial patterns in subsets of large finite fields of low characteristic

Abstract

We prove a low characteristic counterpart to the main result in (Peluse, 2019), establishing power saving bounds for the polynomial Szemer\'edi theorem for certain families of polynomials. Namely, we show that if P1, …, Pm ∈ (Fp[t])[y] satisfy an equidistribution condition, which is a natural variant of the independence condition in (Peluse, 2019) for our context, then there exists γ > 0 such that for any q = pk and any A0, A1, …, Am ⊂eq Fq, align* | \ (x,y) ∈ Fq2 : x ∈ A0, x + P1(y) ∈ A1, …, x + Pm(y) ∈ Am \ | = q-(m-1) Πi=0m|Ai| + Oq ∞; P1, …, Pm ( |A0|1/2 q3/2 - γ ). align* In particular, if A ⊂eq Fq contains no pattern \x, x + P1(y), …, x + Pm(y)\ of cardinality m+1, then align* |A| P1, …, Pm q1 - γ/ ( m + 12 ). align*

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…