论文信息 - Enumerating permutation polynomials over finite fields by degree II

Enumerating permutation polynomials over finite fields by degree II

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

Francesco Pappalardi | Sergei Konyagin | S. Konyagin | F. Pappalardi

[1] R. Lidl,et al. When does a polynomial over a finite field permute the elements of the fields , 1988 .

[2] K. Conrad,et al. Finite Fields , 2018, Series and Products in the Development of Mathematics.

[3] C. Pomerance. A note on the least prime in an arithmetic progression , 1980 .

[4] Claudia Malvenuto,et al. Enumerating permutation polynomials II: k-cycles with minimal degree , 2004, Finite Fields Their Appl..

[5] Claudia Malvenuto,et al. Enumerating Permutation Polynomials I: Permutations with Non-Maximal Degree , 2002 .

[6] Wang Wei. On the least prime in an arithmetic progression , 1991 .

[7] Rudolf Lide,et al. Finite fields , 1983 .

[8] Pinaki Das,et al. The Number of Permutation Polynomials of a Given Degree Over a Finite Field , 2002 .

[9] H. Niederreiter,et al. Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .