Permutation polynomials, projective polynomials, and bijections between $\mu_{\frac{q^n-1}{q-1}}$ and $PG(n-1,q)$

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 use...

An involution over finite fields is a permutation polynomial whose inverse is itself. Owing to this property, involutions over finite fields have been widely used in applications such as cryptography and coding theory. As far as we know, there are not many involutions, and there isn't a general way to construct involutions over finite fields. This paper gives a necessary and sufficient condition for the polynomials of the form $x^rh(x^s)\in \bF_q[x]$ to be involutions over th...

Let $q$ be a prime power, $\mathbb F_q$ be the finite field of order $q$ and $\mathbb F_q(x)$ be the field of rational functions over $\mathbb F_q$. In this paper we classify all rational functions $\varphi\in \mathbb F_q(x)$ of degree 3 that induce a permutation of $\mathbb P^1(\mathbb F_q)$. Our methods are constructive and the classification is explicit: we provide equations for the coefficients of the rational functions using Galois theoretical methods and Chebotarev Dens...

We determine all degree-4 rational functions f(X) in F_q(X) which permute P^1(F_q), and answer two questions of Ferraguti and Micheli about the number of such functions and the number of equivalence classes of such functions up to composing with degree-one rational functions. We also determine all degree-8 rational functions f(X) in F_q(X) which permute P^1(F_q) in case q is sufficiently large, and do the same for degree 32 in case either q is odd or f(X) is a nonsquare. Furt...

Permutation polynomials over finite fields are an interesting and constantly active research subject of study for many years. They have important applications in areas of mathematics and engineering. In recent years, permutation binomials and permutation trinomials attract people's interests due to their simple algebraic forms. In this paper, by reversely using Tu's method for the characterization of permutation polynomials with exponents of Niho type, we propose a new method...

We present new classes of permutation polynomials over finite fields.

In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of o-polynomials, we obtain a class of permutation polynomials of the form $G(x)+ \gamma Tr(H(x))$, where G(X) is neither a permutation nor a linearized polynomial. This is an answer to the open problem 1 of Charpin and Kyureghyan in [P. Charpin and G. Kyureghyan, When does $G(x)+ \gamma Tr(H(x))$ permute $\mathb...

We present a new technique for computing permutation polynomials based on equivalence relations. The equivalence relations are defined by expanded normalization operations and new functions that map permutation polynomials (PPs) to other PPs. Our expanded normalization applies to almost all PPs, including when the characteristic of the finite field divides the degree of the polynomial. The equivalence relations make it possible to reduce the size of the space, when doing an e...

In this paper, we construct two classes of permutation polynomials over $\mathbb{F}_{q^2}$ with odd characteristic from rational R\'{e}dei functions. A complete characterization of their compositional inverses is also given. These permutation polynomials can be generated recursively. As a consequence, we can generate recursively permutation polynomials with arbitrary number of terms. More importantly, the conditions of these polynomials being permutations are very easy to cha...

Permutation polynomials over finite fields have taken an important role in vast areas in mathematics as well as engineering. Recently, Tu et al. gave some classes of complete permutation polynomials over finite fields of even characteristic. In this paper, we give some properties based on a work of Akbary et al. With the help of the properties, we give extensions of Tu et el.'s results to arbitrary characteristic.