English

On the bias of cubic polynomials

Number Theory 2017-01-10 v1 Combinatorics

Abstract

Let VV be a vector space over a finite field k=Fqk=\mathbb{F} _q of dimension nn. For a polynomial P:VkP:V\to k we define the bias of PP to be b1(P)=vVψ(P(V))qnb_1(P)=\frac {|\sum _{v\in V}\psi (P(V))|}{q^n} where ψ:kC\psi :k\to \mathbb{C} ^\star is a non-trivial additive character. A. Bhowmick and S. Lovett proved that for any d1d\geq 1 and c>0c>0 there exists r=r(d,c)r=r(d,c) such that any polynomial PP of degree dd with b1(P)cb_1(P)\geq c can be written as a sum P=i=1rQiRiP=\sum _{i=1}^rQ_iR_i where Qi,Ri:VkQ_i,R_i:V\to k are non constant polynomials. We show the validity of a modified version of the converse statement for the case d=3d=3.

Keywords

Cite

@article{arxiv.1701.02135,
  title  = {On the bias of cubic polynomials},
  author = {David Kazhdan and Tamar Ziegler},
  journal= {arXiv preprint arXiv:1701.02135},
  year   = {2017}
}