๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Enumerating Permutation Polynomials over Finite Fields by Degree

โœ Scribed by Sergei Konyagin; Francesco Pappalardi

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
85 KB
Volume
8
Category
Article
ISSN
1071-5797

No coin nor oath required. For personal study only.

โœฆ Synopsis

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)

๐Ÿ“œ SIMILAR VOLUMES

Groups of Permutation Polynomials over F
Groups of Permutation Polynomials over Finite Fields
โœ Richard M. Stafford ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 195 KB

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.

Enumerating Permutation Polynomials I: P
Enumerating Permutation Polynomials I: Permutations with Non-Maximal Degree
โœ Claudia Malvenuto; Francesco Pappalardi ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 154 KB

Let C be a conjugation class of permutations of a finite field F q . We consider the function N C รฐqรž defined as the number of permutations in C for which the associated permutation polynomial has degree 5q ร€ 2. In 1969, Wells proved a formula for N ยฝ3 รฐqรž where ยฝk denotes the conjugation class of k

The Number of Permutation Polynomials of
The Number of Permutation Polynomials of a Given Degree Over a Finite Field
โœ Pinaki Das ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 139 KB

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

Enumeration of Special Sets of Polynomia
Enumeration of Special Sets of Polynomials over Finite Fields
โœ Astrid Reifegerste ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 379 KB

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

Factoring Polynomials over Special Finit
Factoring Polynomials over Special Finite Fields
โœ Eric Bach; Joachim von zur Gathen; Hendrik W. Lenstra Jr. ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 227 KB

We exhibit a deterministic algorithm for factoring polynomials in one variable over "nite "elds. It is e$cient only if a positive integer k is known for which I (p) is built up from small prime factors; here I denotes the kth cyclotomic polynomial, and p is the characteristic of the "eld. In the cas