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'{e}di theorem for certain families of polynomials. Namely, we show that if

P_{1}, d o t s, P_{m} i n (m a t h b b F_{p} [t]) [y]

satisfy an equidistribution condition, which is a natural variant of the independence condition in (Peluse, 2019) for our context, then there exists

g a m m a > 0

such that for any

q = p^{k}

and any

A_{0}, A_{1}, d o t s, A_{m} s u b s e t e q m a t h b b F_{q}

, �egin{align*} left| left{ (x,y) in mathbb{F}_q^2 : x in A_0, x + P_1(y) in A_1, dots, x + P_m(y) in A_m ight} ight| = q^{-(m-1)} prod_{i=0}^m{|A_i|} + O_{q o infty; P_1, dots, P_m} left( |A_0|^{1/2} q^{3/2 - gamma} ight). end{align*} In particular, if

A s u b s e t e q m a t h b b F_{q}

contains no pattern

x, x + P_{1} (y), d o t s, x + P_{m} (y)

of cardinality

m + 1

, then �egin{align*} |A| ll_{P_1, dots, P_m} q^{1 - gamma/ left( m + frac{1}{2} ight)}. end{align*}

This page was built for publication: Polynomial patterns in subsets of large finite fields of low characteristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6428135)