2000 character limit reached
On the bias of cubic polynomials (1701.02135v1)
Published 9 Jan 2017 in math.NT and math.CO
Abstract: Let $V$ be a vector space over a finite field $k=\mathbb{F} _q$ of dimension $n$. For a polynomial $P:V\to k$ we define the bias of $P$ to be $$b_1(P)=\frac {|\sum _{v\in V}\psi (P(V))|}{qn}$$ where $\psi :k\to \mathbb{C} \star$ is a non-trivial additive character. A. Bhowmick and S. Lovett proved that for any $d\geq 1$ and $c>0$ there exists $r=r(d,c)$ such that any polynomial $P$ of degree $d$ with $b_1(P)\geq c$ can be written as a sum $P=\sum _{i=1}rQ_iR_i$ where $Q_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=3$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.