相关论文: New Permutation Trinomials From Niho Exponents ove…

In this paper, we propose a new method to obtain new permutation polynomials over $\mathbb{F}_{q^2}$. Using this method, we extend many known permutation polynomials, which take the form $\sum_i(x^q-x+\delta)^{s_i}+L(x)$, where $L(x)$ is a…

We construct classes of permutation polynomials over F_{Q^2} by exhibiting classes of low-degree rational functions over F_{Q^2} which induce bijections on the set of (Q+1)-th roots of unity in F_{Q^2}. As a consequence, we prove two…

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$…

The present paper deals with permutations induced by tame automorphisms over finite fields. The first main result is a formula for determining the sign of the permutation induced by a given elementary automorphism over a finite field. The…

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

For polynomials of degree two over finite fields, we present an improvement of Fitzgerald's characterization (Finite Fields Appl. 9(1):117-121, 2003). We then use this new characterization to obtain an explicit, complete, and simple…

In 2019, Xiang Fan \cite{xfan} classified all permutation polynomials of degree $7$ over finite fields of odd characteristics. In this paper, we use this classification to determine the complete list of degree $7$ orthomorphism polynomials…

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…

A class of bilinear permutation polynomials over a finite field of characteristic 2 was constructed in a recursive manner recently which involved some other constructions as special cases. We determine the compositional inverses of them…

Let $\mathbb{F}_{q}$ be the finite field of characteristic $p$ containing $q = p^{r}$ elements and $f(x)=ax^{n} + x^{m}$ a binomial with coefficients in this field. If some conditions on the gcd of $n-m$ an $q-1$ are satisfied then this…

The cohomology of the degree-$n$ general linear group over a finite field of characteristic $p$, with coefficients also in characteristic $p$, remains poorly understood. For example, the lowest degree previously known to contain nontrivial…

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 introduce a class of permutation polynomial over $\mathbb F_{q^n}$ that can be written in the form $\frac{L(x)}{x^{q+1}}$ or $\frac{L(x^{q+1})}x$ for some $q$-linear polynomial $L$ over $\mathbb F_{q^n}$. Specifically, we present those…

We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.

We present an example of a result in graph theory that is used to obtain a result in another branch of mathematics. More precisely, we show that the isomorphism of certain directed graphs implies that some trinomials over finite fields have…

We show that all of the "new" permutation polynomials in the recent paper arXiv:2207.13335 (H. Song et al.) are in fact known. We also present a new type of question in this area.

We classify complete permutation polynomials of type $aX^{\frac{q^n-1}{q-1}+1}$ over the finite field with $q^n$ elements, for $n+1$ a prime and $n^4 < q$. For the case $n+1$ a power of the characteristic we study some known families. We…

We discuss the properties and the permutation behaviour of the reversed Dickson polynomials of the $(k+1)$-th kind $D_{n,k}(1,x)$ over finite fields. The results in this paper unify and generalize several recently discovered results on…

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

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,…