University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Permutation Polynomials modulo m

Li, SJ (2005) Permutation Polynomials modulo m .

Available under License : See the attached licence file.

Download (326kB)
Text (licence)

Download (33kB)


This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation polynomials are given, and the number of all permutation polynomials of given degree and the number induced bijections are estimated. A method is proposed to determine all equivalent polynomials from the induced polynomial function, which can be used to determine all equivalent polynomials that induce a given bijection. A few problems have not been solved yet in this paper and left for open study. Note: After finishing the first draft, we noticed that some results obtained in this paper can be proved in other ways (see Remark 2). In this case, this work gives different and independent proofs of related results.

Item Type: Other
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
Li, SJ
Date : 1 December 2005
Related URLs :
Additional Information : This is an arXiv publication
Depositing User : Symplectic Elements
Date Deposited : 26 Aug 2015 13:47
Last Modified : 31 Oct 2017 14:35

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800