Enumerating permutation polynomials over finite fields by degree II

Authors:
Sergei Konyagin;Francesco Pappalardi
Affiliations:
Department of Mechanics and Mathematics, Moscow State University, Vorobjovy Gory, 119992 Moscow, Russia;Dipartimento di Matematica, Università Degli Studi Roma Tre, Largo S.L. Murialdo, 1, I-00146 Roma, Italy
Venue:
Finite Fields and Their Applications
Year:
2006

Citing 3
Cited 2

Finite fields

Finite fields
The Number of Permutation Polynomials of a Given Degree Over a Finite Field

Finite Fields and Their Applications
Enumerating Permutation Polynomials over Finite Fields by Degree

Finite Fields and Their Applications

On permutation polynomials of prescribed shape

Finite Fields and Their Applications
The Carlitz rank of permutations of finite fields: A survey

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formula for the number of permutations for which the associated permutation polynomial has d coefficients in specified fixed positions equal to 0. This also applies to the function N"q","d that counts the number of permutations for which the associated permutation polynomial has degree