On permutation polynomials over finite fields (Q580430): Difference between revisions

Let GF(q) be the finite field of order q. A polynomial f(x)\(\in GF(q)\) is called a permutation polynomial if the mapping GF(q)\(\to GF(q)\) induced by f(x) is a permutation of GF(q). This paper gives necessary and sufficient conditions on the coefficients of a polynomial over GF(q) to induce a permutation of GF(q). Especially permutation polynomials of the form \(ax^ k+bx^ j+c\) with \(a\neq 0\) over GF(q) are characterized. Furthermore, some results concerning the conjecture of Carlitz, that the cardinality of finite fields with permutation polynomials of a given even degree is bounded, are given. A typical result of the paper for example is: Let \(f(x)=ax^ k+bx+c\) be a polynomial over GF(q) with \(a\neq 0\), \(g.c.d.(k,q)=1\) and \(q>(k^ 2- 4k+6)^ 2.\) Then f is a permutation polynomial if and only if \(b=0\) and \(g.c.d.(k,q-1)=1\).