On factorization of some permutation polynomials over finite fields

Official URL: http://risc01.sabanciuniv.edu/record=b2057958 (Table of Contents)

Factorization of polynomials over finite fields is a classical problem, going back to the 19th century. However, factorization of an important class, namely, of permutation polynomials was not studied previously. In this thesis we present results on factorization of permutation polynomials of Fq,q 2: In order to tackle this problem, we consider permutation polynomials Fn(x)2 Fq[x], n 0; which are defined recursively as compositions of monomials of degree d with gcd(d;q {u100000} 1) = 1, and linear polynomials. Extensions of Fq defined by using the recursive structure of Fn(x) satisfy particular properties that enable us to employ techniques from Galois theory. In consequence, we obtain a variety of results on degrees and number of irreducible factors of the polynomials Fn(x).