Enumerating permutation polynomials over finite fields by degree
Every permutation on the elements of \(\mathbb F_q\) (\(q>2\)) is uniquely represented by a polynomial over \(\mathbb F_q\) of degree \(\leq q-2\). The authors deal with the problem of enumerating such permutation polynomials having degree \(<q-2\). This is equivalent to counting the permutations \(\sigma\) of \(\mathbb F_q\) for which \(\sum_{c\in\mathbb F_q} c\sigma(c)=0\). Let \(N\) denote the number of permutations of \(\mathbb F_q\) satisfying this condition. By inclusion exclusion, \[ N=\sum_{S\subseteq\mathbb F_q} (-1)^{q-|S|}n_S \] where \(n_S\) is the number of mappings \(f\colon\mathbb F_q\to S\) with \(\sum_{c\in S} cf(c)=0\). Using an expression for \(n_S\) in terms of exponential sums, the authors then show that \[ |N-(q-1)!|\leq\sqrt{2e/\pi}q^{q/2}. \] A similar estimate for a prime \(q\) was determined, using a different method, by \textit{P. Das} [Finite Fields Appl. 8, 478--490 (2002; Zbl 1029.11066)].
- The number of permutation polynomials of a given degree over a finite field
- Enumerating permutation polynomials
- Enumerating permutation polynomials. I: Permutations with non-maximal degree
- On permutation polynomials over finite fields
- Enumerating permutation polynomials over finite fields by degree. II
- Enumerating permutation polynomials. I: Permutations with non-maximal degree
- Enumerating permutation polynomials. II: \(k\)-cycles with minimal degree.
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 897188 (Why is no real title available?)
- When Does a Polynomial Over a Finite Field Permute the Elements of the Field?
- When Does a Polynomial over a Finite Field Permute the Elements of the Field?, II
- On permutation polynomials of prescribed shape
- Permutation polynomials over the rational numbers
- Enumeration of special sets of polynomials over finite fields
- Enumerating permutation polynomials. II: \(k\)-cycles with minimal degree.
- The number of permutation polynomials of a given degree over a finite field
- Enumerating permutation polynomials. I: Permutations with non-maximal degree
- The number of polynomials of a given degree over a finite field with value sets of a given cardinality
- Degree of orthomorphism polynomials over finite fields
- Full classification of permutation rational functions and complete rational functions of degree three over finite fields
- Distinct coordinate solutions of linear equations over finite fields
- Enumerating permutation polynomials
- The Carlitz rank of permutations of finite fields: a survey
- On the algebraic degree of iterated power functions
- Enumeration of a class of sequences generated by inversions
- scientific article; zbMATH DE number 786175 (Why is no real title available?)
- Derivative polynomials and enumeration of permutations by number of interior and left peaks
- Enumerating permutation polynomials over finite fields by degree. II
This page was built for publication: Enumerating permutation polynomials over finite fields by degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1867467)
