Constructing permutation polynomials using generalized Redei functions

Abstract

We determine all permutations in two large classes of polynomials over finite fields, where the construction of the polynomials in each class involves the denominators of a class of rational functions generalizing the classical Redei functions. Our results generalize eight recent results from the literature, and our proofs of our more general results are much shorter and simpler than the previous proofs of special cases.