Abstract

AbstractDickson polynomials over finite fields are familiar examples of permutation polynomials, i.e. of polynomials for which the corresponding polynomial mapping is a permutation of the finite field. We prove that a Dickson polynomial can be a complete mapping polynomial only in some special cases. Complete mapping polynomials are of interest in combinatorics and are defined as polynomials f(x) over a finite field for which both f(x) and f(x) + x are permutation polynomials. Our result also verifies a special case of a conjecture of Chowla and Zassenhaus on permutation polynomials.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call