On permutation polynomials over finite fields

R. A. Mollin and C. Small

International Journal of Mathematics and Mathematical Sciences, 1987, vol. 10, 1-9

Abstract:

A polynomial f over a finite field F is called a permutation polynomial if the mapping F → F defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a polynomial which are necessary and sufficient for it to represent a permutation. We also give some results bearing on a conjecture of Carlitz which says essentially that for any even integer m , the cardinality of finite fields admitting permutation polynomials of degree m is bounded.

Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/10/393016.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/10/393016.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:393016

DOI: 10.1155/S0161171287000644

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().