Enumerating Permutation Polynomials over finite fields by degree

基于二次型的置换多项式的一般方法

A general approach to permutation polynomials from quadratic forms

本文研究特征2有限域上的置换多项式，通过建立其与二次型的联系，提出一般刻画方法，并利用特征和的确定明确描述了几类置换多项式。

Specific permutation polynomials over finite fields

We present new classes of permutation polynomials over finite fields.

A Classification of Permutation Polynomials through Some Linear Maps

In this paper, we propose linear maps over the space of all polynomials $f(x)$ in $\mathbb{F}_q[x]$ that map $0$ to itself, through their evaluation map. Properties of these linear maps throw up interesting connections with permutation polynomials. We study certain properties of these linear maps. We propose to classify permutation polynomials by identifying the generalized eigenspaces of these maps, where the permutation polynomials reside. As it turns out, several classes of permutation polynomials studied in literature neatly fall into classes defined using these linear maps. We characteriz…

A note on inverses of cyclotomic mapping permutation polynomials over finite fields

In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation polynomials that are involutions. Our results provide a fast algorithm (only modular operations are involved) to generate many classes of generalized cyclotomic permutation polynomials, their inverses, and involutions.

Piecewise constructions of inverses of cyclotomic mapping permutation polynomials

Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite fields.

基于局部判据的有限域上的置换多项式

Permutation polynomials over finite fields by the local criterion

本文进一步研究了局部判据，提出了一类在 $\mathbb{F}_{q^2}$ 上的置换多项式及其复合逆，并证明了线性化多项式与所有置换多项式在特定条件下均为局部置换多项式。

Permutation polynomials: iteration of shift and inversion maps over finite fields

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group generated by shift and inversion maps is used to study the randomness properties of permutation polynomials.

On inverse of permutation polynomials of small degree over finite fields, II

We investigate the permutation property of polynomials of the form $x^{r}(x^{s} -a)^{t}$, and give the expressions of their inverses. In particular, explicit expressions of inverses of permutation polynomials $x(x^3 -a)^2$ and $x(x^2 -a)^3$ on $\mathbb{F}_{7^n}$ are presented. Then, using some known results, we obtain the inverses of all permutation polynomials of degree $6, 7, 8$ over finite fields.

On constructing complete permutation polynomials over finite fields of even characteristic

In this paper, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. recently is generalized in a recursive manner. Besides, several classes of complete permutation polynomials are derived by computing compositional inverses of known ones.

A note on the permutation behaviour of the polynomial $g_{n,q}$

Let $q=4$ and $k$ a positive integer. In this short note, we present a class of permutation polynomials over $\Bbb F_{q^{3k}}$. We also present a generalization.

On inverses of some permutation polynomials over finite fields of characteristic three

By using the piecewise method, Lagrange interpolation formula and Lucas' theorem, we determine explicit expressions of the inverses of a class of reversed Dickson permutation polynomials and some classes of generalized cyclotomic mapping permutation polynomials over finite fields of characteristic three.

The dynamics of permutations on irreducible polynomials

We study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree $k$ over $\mathbb{F}_q$ is induced by an action from a permutation polynomial of $\mathbb{F}_{q^k}$ with coefficients in $\mathbb{F}_q$. The dynamics of these permutations of irreducible polynomials of degree $k$ over $\mathbb{F}_q$, such as fixed points and cycle lengths, are studied. As an application, we also generate irreducible polynomials of the same degree by an iterative method.

Permutation Polynomials with Carlitz Rank 2

Let $\mathbb{F}_q$ denote the finite field with $q$ elements. The Carlitz rank of a permutation polynomial is a important measure of complexity of the polynomial. In this paper we find the sharp lower bound for the weight of any permutation polynomial with Carlitz rank $2$, improving the bound found by Gómez-Pérez, Ostafe and Topuzoğlu in that case.

通过线性平移子构造的一些置换多项式

Some permutation polynomials via linear translators

本文受先前工作启发，扩展线性平移子概念，并据此在有限域上构造新的置换多项式类。

A classification of permutation polynomials of degree $7$ over finite fields

Up to linear transformations, we give a classification of all permutation polynomials of degree $7$ over $\mathbb{F}_{q}$ for any odd prime power $q$, with the help of the SageMath software.

有限域上分圆映射置换多项式的进一步研究

Further Investigation on Cyclotomic Mapping Permutation Polynomials over Finite Fields

本文研究了有限域上分圆映射置换多项式与特定形式置换多项式的关系，提出新的判定条件，并据此构造了若干置换三项式和二项式。

关于一类置换多项式及其逆

On a Class of Permutation Polynomials and Their Inverses

本文提出一类有限域上的置换多项式，给出其显式形式及逆，并推广至更一般形式。

关于通过有限域上纤维准则的排列三项式与完全排列多项式

On Permutation Trinomials and Complete Permutation Polynomials via Fiber Criteria over Finite Fields

本文通过Zieve纤维准则和AGW准则结合，提出了一种构造有限域上完全排列多项式的方法，并通过实例验证了其有效性。

Permutation Polynomials of Degree 6 or 7 over Finite Fields of Characteristic 2

In \cite{D1}, Dickson listed all permutation polynomials up to degree 5 over an arbitrary finite field, and all permutation polynomials of degree 6 over finite fields of odd characteristic. The classification of degree 6 permutation polynomials over finite fields of characteristic 2 was left incomplete. In this paper we complete the classification of permutation polynomials of degree 6 over finite fields of characteristic 2. In addition, all permutation polynomials of degree 7 over finite fields of characteristic 2 are classified.

Permutation polynomials, fractional polynomials, and algebraic curves

In this note we prove a conjecture by Li, Qu, Li, and Fu on permutation trinomials over $\mathbb{F}_3^{2k}$. In addition, new examples and generalizations of some families of permutation polynomials of $\mathbb{F}_{3^k}$ and $\mathbb{F}_{5^k}$ are given. We also study permutation quadrinomials of type $Ax^{q(q-1)+1} + Bx^{2(q-1)+1} + Cx^{q} + x$. Our method is based on the investigation of an algebraic curve associated with a {fractional polynomial} over a finite field.

Complete permutation polynomials over finite fields of odd characteristic

In this paper, we present three classes of complete permutation monomials over finite fields of odd characteristic. Meanwhile, the compositional inverses of these complete permutation polynomials are also proposed.

Permutation polynomials and complete permutation polynomials over $\mathbb{F}_{q^{3}}$

Motivated by many recent constructions of permutation polynomials over $\mathbb{F}_{q^2}$, we study permutation polynomials over $\mathbb{F}_{q^3}$ in terms of their coefficients. Based on the multivariate method and resultant elimination, we construct several new classes of sparse permutation polynomials over $\mathbb{F}_{q^3}$, $q=p^{k}$, $p\geq3$. Some of them are complete mappings.

The Slope Polynomial and Collinear Points in Permutations

Withdrawn due to fatal errors.

Permutation Polynomials modulo m

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…

Necessities and sufficiencies of a class of permutation polynomials over finite fields

For the finite field $\mathbb{F}_{2^{3m}}$, permutation polynomials of the form $(x^{2^m}+x+δ)^{s}+cx$ are studied. Necessary and sufficient conditions are given for the polynomials to be permutation polynomials. For this, the structures and properties of the field elements are analyzed.

More Classes of Complete Permutation Polynomials over $\F_q$

In this paper, by using a powerful criterion for permutation polynomials given by Zieve, we give several classes of complete permutation monomials over $\F_{q^r}$. In addition, we present a class of complete permutation multinomials, which is a generalization of recent work.

A Class of Binomial Permutation Polynomials

In this note, a criterion for a class of binomials to be permutation polynomials is proposed. As a consequence, many classes of binomial permutation polynomials and monomial complete permutation polynomials are obtained. The exponents in these monomials are of Niho type.

Some new results on permutation polynomials over finite fields

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of trinomial complete permutation polynomials are presented, one of which confirms a conjecture proposed by Wu et al. (Sci. China Math., to appear. Doi: 10.1007/s11425-014-4964-2). Furthermore, we give two classes of trinomial permutation polynomials, and make some progress on a conjecture about the differential uniformity of power permutation polynomials proposed by B…

Permutation polynomials induced from permutations of subfields, and some complete sets of mutually orthogonal latin squares

We present a general technique for obtaining permutation polynomials over a finite field from permutations of a subfield. By applying this technique to the simplest classes of permutation polynomials on the subfield, we obtain several new families of permutation polynomials. Some of these have the additional property that both f(x) and f(x)+x induce permutations of the field, which has combinatorial consequences. We use some of our permutation polynomials to exhibit complete sets of mutually orthogonal latin squares. In addition, we solve the open problem from a recent paper by Wu and Lin, and…

基于Rédei函数的奇特征$\mathbb{F}_{q^2}$上置换多项式的递归构造

A Recursive Construction of Permutation Polynomials over $\mathbb{F}_{q^2}$ with Odd Characteristic from Rédei Functions

本文利用有理Rédei函数递归构造了奇特征$\mathbb{F}_{q^2}$上的两类置换多项式，完整刻画了其合成逆，并给出了易于验证的置换条件及若干二项式、三项式实例，发现此类多项式数量庞大。

Local permutation polynomials and the action of e-Klenian groups

Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric subgroups without fixed points, the so called e-Klenian groups. In the second part we use the fact that bivariate local permutation polynomials define Latin Squares, to discuss several constructions of Mutually Orthogonal Latin Squares (MOLS) and, in particular, we provide a new family of MOLS on size a prime power.