Abstract
We relate the number of permutation polynomials in Fq[x] of degree d≤q−2 to the solutions (x1,x2,…,xq) of a system of linear equations over Fq, with the added restriction that xi≠0 and xi≠xj whenever i≠j. Using this we find an expression for the number of permutation polynomials of degree p−2 in Fp[x] in terms of the permanent of a Vandermonde matrix whose entries are the primitive pth roots of unity. This leads to nontrivial bounds for the number of such permutation polynomials. We provide numerical examples to illustrate our method and indicate how our results can be generalised to polynomials of other degrees.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.