Related papers: A Class of Permutation Trinomials over Finite Fiel…

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…

It is well known that there exists a significant equivalence between the vector space $\mathbb{F}_{q}^n$ and the finite fields $\mathbb{F}_{q^n}$, and many scholars often view them as the same in most contexts. However, the precise…

Permutation polynomials with few terms (especially permutation binomials) attract many people due to their simple algebraic structure. Despite the great interests in the study of permutation binomials, a complete characterization of…

In this paper, a class of permutation trinomials of Niho type over finite fields with even characteristic is further investigated. New permutation trinomials from Niho exponents are obtained from linear fractional polynomials over finite…

We show that univariate trinomials $x^n + ax^s + b \in \mathbb{F}_q[x]$ can have at most $\delta \Big\lfloor \frac{1}{2} +\sqrt{\frac{q-1}{\delta}} \Big\rfloor$ distinct roots in $\mathbb{F}_q$, where $\delta = \gcd(n, s, q - 1)$. We also…

Permutation polynomials with explicit constructions over finite fields have long been a topic of great interest in number theory. In recent years, by applying linear translators of functions from $\mathbb{F}_{q^n}$ to $\mathbb{F}_q$, many…

Let q be an odd power of a prime p and let A/Fq be a supersingular abelian variety of dimension g. We show that if p>2g+1, then the characteristic polynomial of the q-Frobenius is an even polynomial. This generalizes the well-known result…

In this paper, we present several necessary conditions for the reversed Dickson polynomial $E_{n}(1, x)$ of the second kind to be a permutation of $\mathbb{F}_{q}$. In particular, we give explicit evaluation of the sum $\sum_{a\in…

We say that a monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N\ge 2$ is monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb…

Recently, P. Yuan presented a local method to find permutation polynomials and their compositional inverses over finite fields. The work of P. Yuan inspires us to compute the compositional inverses of three classes of the permutation…

In this paper, by analyzing the quadratic factors of an $11$-th degree polynomial over the finite field $\ftwon$, a conjecture on permutation trinomials over $\ftwon[x]$ proposed very recently by Deng and Zheng is settled, where $n=2m$ and…

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…

A polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called \emph{monogenic} if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…

The construction of permutation trinomials of the form $X^r(X^{\alpha (2^m-1)}+X^{\beta(2^m-1)} + 1)$ over $\F_{2^{2m}}$, where $m,~r\text{ and }\alpha > \beta$ are positive integers, is an active area of research. Several classes of…

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…

In this paper, we make use of the classification results of low-degree permutation rational functions together with their geometric properties to investigate rational functions that induce permutations on the multiplicative subgroup mu_q+1,…

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…

For any given polynomial $f$ over the finite field $\mathbb{F}_q$ with degree at most $q-1$, we associate it with a $q\times q$ matrix $A(f)=(a_{ik})$ consisting of coefficients of its powers $(f(x))^k=\sum_{i=0}^{q-1}a_{ik} x^i$ modulo…

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…