Permutation polynomial

In mathematics, a permutation polynomial (for a given ring) is a polynomial that acts as a permutation of the elements of the ring, i.e. the map formula_1 is a bijection. In case the ring is a finite field, the Dickson polynomials, which are closely related to the Chebyshev polynomials, provide examples. Over a finite field, every function, so in particular every permutation of the elements of that field, can be written as a polynomial function.
In the case of finite rings Z/"n"Z, such polynomials have also been studied and applied in the interleaver component of error detection and correction algorithms.
Single variable permutation polynomials over finite fields.
Let be the finite field of characteristic , that is, the field having elements where for some prime . A polynomial with coefficients in (symbolically written as ) is a "permutation polynomial" of if the function from to itself defined by formula_2 is a permutation of .
Due to the finiteness of , this definition can be expressed in several equivalent ways:
A characterization of which polynomials are permutation polynomials is given by
("Hermite's Criterion") is a permutation polynomial of if and only if the following two conditions hold:
If is a permutation polynomial defined over the finite field , then so is for all and in . The permutation polynomial is in normalized form if and are chosen so that is monic, and (provided the characteristic does not divide the degree of the polynomial) the coefficient of is 0.
There are many open questions concerning permutation polynomials defined over finite fields (see and ).
Small degree.
Hermite's criterion is computationally intensive and can be difficult to use in making theoretical conclusions. However, Dickson was able to use it to find all permutation polynomials of degree at most five over all finite fields. These results are:
A list of all monic permutation polynomials of degree six in normalized form can be found in .
Some classes of permutation polynomials.
Beyond the above examples, the following list, while not exhaustive, contains almost all of the known major classes of permutation polynomials over finite fields.
These can also be obtained from the recursion
with the initial conditions formula_8 and formula_9.
The first few Dickson polynomials are:
If and then permutes GF("q") if and only if . If then and the previous result holds.
The linearized polynomials that are permutation polynomials over form a group under the operation of composition modulo formula_16, which is known as the Betti-Mathieu group, isomorphic to the general linear group .
Exceptional polynomials.
An exceptional polynomial over is a polynomial in which is a permutation polynomial on for infinitely many .
A permutation polynomial over of degree at most is exceptional over .
Every permutation of is induced by an exceptional polynomial.
If a polynomial with integer coefficients (i.e., in ) is a permutation polynomial over for infinitely many primes , then it is the composition of linear and Dickson polynomials. (See Schur's conjecture below).
Geometric examples.
In finite geometry coordinate descriptions of certain point sets can provide examples of permutation polynomials of higher degree. In particular, the points forming an oval in a finite projective plane, with a power of 2, can be coordinatized in such a way that the relationship between the coordinates is given by an "o-polynomial", which is a special type of permutation polynomial over the finite field .
Computational complexity.
The problem of testing whether a given polynomial over a finite field is a permutation polynomial can be solved in polynomial time.
Permutation polynomials in several variables over finite fields.
A polynomial formula_19 is a permutation polynomial in variables over formula_20 if the equation formula_21 has exactly formula_22 solutions in formula_23 for each formula_24.
Quadratic permutation polynomials (QPP) over finite rings.
For the finite ring Z/"n"Z one can construct quadratic 
permutation polynomials. Actually it is possible if and only if "n" is divisible by "p2" for some prime number "p". 
The construction is surprisingly simple, nevertheless it can produce permutations with certain good properties. That is why it has been used in the interleaver component of turbo codes in 3GPP Long Term Evolution mobile telecommunication standard (see 3GPP technical specification 36.212 e.g. page 14 in version 8.8.0).
Simple examples.
Consider formula_25 for the ring Z/"4"Z.
One sees: formula_26,
so the polynomial defines the permutation
Consider the same polynomial formula_25 for the other ring Z/"8"Z.
One sees: formula_29,
so the polynomial defines the permutation
Rings Z/"pk"Z.
Consider formula_31 for the ring Z/"pk"Z.
Lemma: for "k=1" (i.e. Z/"p"Z) such polynomial defines a permutation
only in the case "a=0" and "b" not equal to zero. So the polynomial is not quadratic, but linear.
Lemma: for "k>1", "p>2" (Z/"pk"Z) such polynomial defines a permutation if and only if formula_32 and formula_33.
Rings Z/"n"Z.
Consider formula_34, where "pt" are prime numbers.
Lemma: any polynomial formula_35, where 
formula_36 are remainders of formula_37
modulo formula_38.
As a corollary one can construct plenty quadratic permutation polynomials using the following simple construction. 
Consider formula_34, assume that "k1 >1".
Consider formula_40, such that formula_41, but formula_42; assume that formula_43,"i">1. And assume that formula_44 for all "i"=1..."l".
(For example, one can take 
formula_45
and formula_46).
Then such polynomial defines a permutation.
To see this we observe that for all primes "pi","i">1, the reduction of this quadratic polynomial modulo "pi" is actually linear polynomial and hence is permutation by trivial reason. For the first prime number we should use 
the lemma discussed previously to see that it defines the permutation.
For example, consider Z/"12"Z and polynomial formula_47.
It defines a permutation
Higher degree polynomials over finite rings.
A polynomial "g"("x") for the ring Z/"pkZ is a permutation polynomial if and only if it permutes the finite field Z/"pZ and formula_49 for all "x" in Z/"pk"Z, where "g"′("x") is the formal derivative of "g"("x").
Schur's conjecture.
Let "K" be an algebraic number field with "R" the ring of integers. The term "Schur's conjecture" refers to the assertion 
that, if a polynomial "f" defined over "K" is a permutation polynomial on "R"/"P" for infinitely many prime ideals "P", then "f" is the composition of Dickson polynomials, degree-one polynomials, and polynomials of the form "x""k". In fact, Schur did not make any conjecture in this direction. The notion that he did is due to Fried, who gave a flawed proof of a false version of the result. Correct proofs have been given by Turnwald 
and Müller.