On Permutation Polynomials Over Finite Fields

Abstract

A polynomial f over a finite field F is called a permutation polynomial if the mapping F → F defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a polynomial which are necessary and sufficient for it to represent a permutation. We also give some results bearing on a conjecture of Carlitz which says essentially that for any even integer m, the cardinality of finite fields admitting permutation polynomials of degreem is bounded. © 1987, Hindawi Publishing Corporation. All rights reserved.