English
Related papers

Related papers: A Note on Permutation Binomials and Trinomials ove…

200 papers

We investigate fixed points and cycle types of permutation polynomials and complete permutation polynomials arising from reversed Dickson polynomials of the first kind and second kind over $\mathbb{F}_p$. We also study the permutation…

Number Theory · Mathematics 2023-07-13 Jiaqi Fang , Neranga Fernando , Haoming Wu

Let $f=a\x+\x^{3q-2}\in\Bbb F_{q^2}[\x]$, where $a\in\Bbb F_{q^2}^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q=2^e$, $e$ odd, and $a^{\frac{q+1}3}$ is a primitive…

Number Theory · Mathematics 2013-12-24 Xiang-dong Hou , Stephen D. Lappano

Permutation polynomials over finite fields have wide applications in many areas of science and engineering. In this paper, we present six new classes of permutation trinomials over $\mathbb{F}_{2^n}$ which have explicit forms by determining…

Information Theory · Computer Science 2017-06-02 Yanping Wang , WeiGuo Zhang , Zhengbang Zha

The $k$th Dickson polynomial of the first kind, $D_k(x) \in {\mathbb Z}[x]$, is determined by the formula: $D_k(u+1/u) = u^k + 1/u^k$, where $k \ge 0$ and $u$ is an indeterminate. These polynomials are closely related to Chebyshev…

Number Theory · Mathematics 2021-08-17 Antonia W. Bluher

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…

Information Theory · Computer Science 2016-06-14 Nian Li , Tor Helleseth

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.

Number Theory · Mathematics 2013-12-04 Guangkui Xu , Xiwang Cao , Ziran Tu , Xiangyong Zeng , Lei Hu

We consider four classes of polynomials over the fields $\mathbb{F}_{q^3}$, $q=p^h$, $p>3$, $f_1(x)=x^{q^2+q-1}+Ax^{q^2-q+1}+Bx$, $f_2(x)=x^{q^2+q-1}+Ax^{q^3-q^2+q}+Bx$, $f_3(x)=x^{q^2+q-1}+Ax^{q^2}-Bx$, $f_4(x)=x^{q^2+q-1}+Ax^{q}-Bx$,…

Combinatorics · Mathematics 2018-04-05 Daniele Bartoli

R. Gupta, P. Gahlyan and R.K. Sharma presented three classes of permutation trinomials over $\mathbb{F}_{q^3}$ in Finite Fields and Their Applications. In this paper, we employ the local method to prove that those polynomials are indeed…

Number Theory · Mathematics 2024-09-30 Danyao Wu , Pingzhi Yuan , Huanhuan Guan , Juan Li

Permutation polynomials have many applications in finite fields theory, coding theory, cryptography, combinatorial design, communication theory, and so on. Permutation binomials of the form $x^{r}(x^{q-1}+a)$ over $\mathbb{F}_{q^2}$ have…

Information Theory · Computer Science 2019-08-08 Xiaogang Liu

In this paper, the compositional inverses of a class of linearized permutation polynomials of the form $P(x)=x+x^2+\tr(\frac{x}{a})$ over the finite field $\mathbb{F}_{2^n}$ for an odd positive integer $n$ are explicitly determined.

Combinatorics · Mathematics 2013-07-02 Baofeng Wu

Let $p>3$ and consider a prime power $q=p^h$. We completely characterize permutation polynomials of $\mathbb{F}_{q^2}$ of the type $f_{a,b}(X) = X(1 + aX^{q(q-1)} + bX^{2(q-1)}) \in \mathbb{F}_{q^2}[X]$. In particular, using connections…

Combinatorics · Mathematics 2019-11-22 Daniele Bartoli , Marco Timpanella

We construct four new classes of permutation trinomials over the cubic extension of a finite field with even characteristic. Additionally, we explicitly provide the compositional inverse of each class of permutation trinomials in polynomial…

Number Theory · Mathematics 2025-05-06 Sartaj Ul Hasan , Ramandeep Kaur , Hridesh Kumar

Let $q>2$ be a prime power and $f={\tt x}^{q-2}+t{\tt x}^{q^2-q-1}$, where $t\in\Bbb F_q^*$. It was recently conjectured that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following holds: (i) $t=1$, $q\equiv…

Number Theory · Mathematics 2012-10-03 Xiang-dong Hou

We explore the connection between cyclotomic mapping permutation polynomials and permutation polynomials of the form $x^rf(x^{\frac{q-1}{l}})$ over finite fields. We present a new necessary and a new sufficient condition to verify…

Number Theory · Mathematics 2025-10-13 Suman Mondal

We focus on the permutation polynomials of the form $L(X)+\Tr_{m}^{3m}(X)^{s}$ over $\F_{q^3}$, where $\F_q$ is the finite field with $q=p^m$ elements, $p$ is a prime number, $m$ is a positive integer, $\Tr_{m}^{3m}$ is the relative trace…

Number Theory · Mathematics 2024-07-18 Sartaj Ul Hasan , Ramandeep Kaur

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we determine all permutation trinomials over $\mathbb{F}_{2^m}$ in Zieve's paper. We prove…

Combinatorics · Mathematics 2022-09-13 Danyao Wu , Pingzhi Yuan , Cunsheng Ding , Yuzhen Ma

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…

Number Theory · Mathematics 2014-04-09 Shaofang Hong , Xiaoer Qin

Let $q$ be a prime power and $n$ and $r$ be positive integers. It is well known that the linearized binomial $L_r(x)=x^{q^r}+ax\in\mathbb{F}_{q^n}[x]$ is a permutation polynomial if and only if $(-1)^{n/d}a^{{(q^n-1)}/{(q^{d}-1)}}\neq 1$…

Number Theory · Mathematics 2013-11-12 Baofeng Wu

Let $q>2$ be a prime power and $f=-{\tt x}+t{\tt x}^q+{\tt x}^{2q-1}$, where $t\in\Bbb F_q^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q$ is even and…

Number Theory · Mathematics 2013-03-05 Xiang-dong Hou

We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…

Number Theory · Mathematics 2013-10-08 Ariane M. Masuda , Michael E. Zieve