Enumerating Permutation Polynomials over finite fields by degree

2001/06/27 by Sergeĭ Konyagin, Sergei Konyagin, Konyagin, Sergei +2 · 1 citation
Computer Science · Engineering · Mathematics · #11T06 (primary) 11T23 (secondary) #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Number Theory (math.NT) #graph theory and CDMA systems #math.NT #msc:11T06 #msc:11T23

paper · pdf · doi:10.48550/arxiv.math/0106232

LaTeX2e amsart 5 pages

arxiv created 2001/06/27 · openalex publication_date 2001/06/27 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We prove an asymptotic formula for the number of permutation for which the associated permutation polynomial has degree smaller than q-2.

Cited by

• An algebraic approach to Latin squares of prime power order by local permutation polynomials

Related

• On the number of permutation polynomials over a finite field
• Specific permutation polynomials over finite fields
• Further Results on Permutation Polynomials over Finite Fields
• A note on permutation polynomials over finite fields
• Further results on some classes of permutation polynomials over finite fields