A New Approach to Permutation Polynomials over Finite Fields, II
Abstract
Let p be a prime and q a power of p. For n 0, let gn,q∈ Fp[ x] be the polynomial defined by the functional equation Σa∈ Fq( x+a)n=gn,q( xq- x). When is gn,q a permutation polynomial (PP) of Fqe? This turns out to be a challenging question with remarkable breath and depth, as shown in the predecessor of the present paper. We call a triple of positive integers (n,e;q) desirable if gn,q is a PP of Fqe. In the present paper, we find many new classes of desirable triples whose corresponding PPs were previously unknown. Several new techniques are introduced for proving a given polynomial is a PP.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.