On Constructing Two Classes of Permutation Polynomials over Finite Fields  

作　　者：CHENG Kaimin 

机构地区：[1]School of Mathematics and Information, China West Normal University

出　　处：《Wuhan University Journal of Natural Sciences》2019年第6期505-509,共5页武汉大学学报（自然科学英文版）

基　　金：Supported by the Research Initiation Fund for Young Teachers of China West Normal University(412679)

摘　　要：In this paper, we construct two classes of permutation polynomials over finite fields. First, by one well-known lemma of Zieve, we characterize one class permutation polynomials of the finite field, which generalizes the result of Marcos. Second, by using the onto property of functions related to the elementary symmetric polynomial in multivariable and the general trace function, we construct another class permutation polynomials of the finite field. This extends the results of Marcos, Zieve, Qin and Hong to the more general cases. Particularly, the latter result gives a rather more general answer to an open problem raised by Zieve in 2010.In this paper, we construct two classes of permutation polynomials over finite fields. First, by one well-known lemma of Zieve, we characterize one class permutation polynomials of the finite field, which generalizes the result of Marcos. Second, by using the onto property of functions related to the elementary symmetric polynomial in multivariable and the general trace function, we construct another class permutation polynomials of the finite field. This extends the results of Marcos, Zieve, Qin and Hong to the more general cases. Particularly, the latter result gives a rather more general answer to an open problem raised by Zieve in 2010.

关 键 词：PERMUTATION POLYNOMIAL ELEMENTARY symmetric POLYNOMIAL finite field TRACE function 

分 类 号：O156.2[理学—数学]