We prove an asymptotic formula for the number of permutations for which the associated permutation polynomial has degree smaller than q ร 2. # 2002 Elsevier Science (USA)
Compositional attractors and enumeration of permutation polynomials over finite fields
โ Scribed by Daniel A. Ashlock
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 560 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0022-4049
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let F be a finite field. We apply a result of Thierry Berger (1996, Designs Codes Cryptography, 7, 215-221) to determine the structure of all groups of permutations on F generated by the permutations induced by the linear polynomials and any power map which induces a permutation on F.
In this paper we consider squarefree polynomials over finite fields whose gcd with their reciprocal and Frobenius conjugate polynomial is trivial, respectively. Our focus is on the enumeration of these special sets of polynomials, in particular, we give the number of squarefree palindromes. These in
A class of permutation polynomials amongst the Chebyshev polynomials of the second kind has been described by the second author. Cohen has shown that in prime fields of odd order or their degree 2 extensions these are the only examples of such polynomials. In this paper, the authors present new clas
We relate the number of permutation polynomials in F q ยฝx of degree d q ร 2 to the solutions รฐx 1 ; x 2 ; . . . ; x q ร of a system of linear equations over F q , with the added restriction that x i =0 and x i =x j whenever i=j. Using this we find an expression for the number of permutation polynomi