2000 character limit reached
A New Approach to Permutation Polynomials over Finite Fields, II (1208.2942v1)
Published 14 Aug 2012 in math.CO and math.NT
Abstract: Let $p$ be a prime and $q$ a power of $p$. For $n\ge 0$, let $g_{n,q}\in\Bbb F_p[{\tt x}]$ be the polynomial defined by the functional equation $\sum_{a\in\Bbb F_q}({\tt x}+a)n=g_{n,q}({\tt x}q-{\tt x})$. When is $g_{n,q}$ a permutation polynomial (PP) of $\Bbb F_{qe}$? This turns out to be a challenging question with remarkable breath and depth, as shown in the predecessor of the present paper. We call a triple of positive integers $(n,e;q)$ {\em desirable} if $g_{n,q}$ is a PP of $\Bbb F_{qe}$. In the present paper, we find many new classes of desirable triples whose corresponding PPs were previously unknown. Several new techniques are introduced for proving a given polynomial is a PP.