Enumerating permutation polynomials over finite fields by degree II

被引：8

作者：

Konyagin, S

Pappalardi, F

机构：

[1] Univ Roma Tre, Dipartimento Matemat, I-00146 Rome, Italy

[2] Moscow MV Lomonosov State Univ, Dept Mech & Math, Moscow 119992, Russia

来源：

FINITE FIELDS AND THEIR APPLICATIONS | 2006年 / 12卷 / 01期

关键词：

permutation polynomials; finite fields; exponential sums;

D O I：

10.1016/j.ffa.2004.12.006

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 Nq,d that counts the number of permutations for which the associated pen-nutation polynomial has degree < q-d-1. Next we adopt a more precise approach to show that the asymptotic formula Nq,d similar to q!/q(d) holds for d <= alpha q and alpha = 0.03983. (c) 2005 Elsevier Inc. All rights reserved.

引用

页码：26 / 37

页数：12