vix.ing · top · new · best · stats · spec

Polynomial patterns in subsets of large finite fields of low characteristic

2023/03/02 by Ackelsberg, Ethan, Bergelson, Vitaly
#11B30 (Primary) 11T06 #37A25 (Secondary) #Dynamical Systems (math.DS) #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2303.00925

Abstract

We prove a low characteristic counterpart to the main result in (Peluse, 2019), establishing power saving bounds for the polynomial Szemerédi theorem for certain families of polynomials. Namely, we show that if P1, …, Pm ∈ (\mathbbFp[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 ⊆ \mathbbFq, | \ (x,y) ∈ \mathbbFq2 : x ∈ A0, x + P1(y) ∈ A1, …, x + Pm(y) ∈ Am \ | = q-(m-1)i=0m|Ai| + Oq → ∞; P1, …, Pm ( |A0|1/2 q3/2 - γ ). In particular, if A ⊆ \mathbbFq contains no pattern \x, x + P1(y), …, x + Pm(y)\ of cardinality m+1, then |A| ≪P1, …, Pm q1 - γ/ ( m + (1)/(2) ).

Related