Enumerating Permutation Polynomials over finite fields by degree
| dc.creator | Konyagin, Sergei | |
| dc.creator | Pappalardi, Francesco | |
| dc.date | 2001-06-27 | |
| dc.date.accessioned | 2026-07-07T04:42:20Z | |
| dc.date.available | 2026-07-07T04:42:20Z | |
| dc.description | We prove an asymptotic formula for the number of permutation for which the associated permutation polynomial has degree smaller than $q-2$. | |
| dc.description | LaTeX2e amsart 5 pages | |
| dc.identifier | https://arxiv.org/abs/math/0106232 | |
| dc.identifier | http://arxiv.org/abs/math/0106232 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/61739 | |
| dc.subject | Number Theory | |
| dc.subject | 11T06 (primary) 11T23 (secondary) | |
| dc.title | Enumerating Permutation Polynomials over finite fields by degree | |
| dc.type | text |