English
Related papers

Related papers: A proof of a conjecture on permutation trinomials

200 papers

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

Let $q$ be a prime power. We determine all permutation trinomials of $\Bbb F_{q^2}$ of the form $ax+bx^q+x^{2q-1}\in\Bbb F_{q^2}[x]$. The subclass of such permutation trinomials of $\Bbb F_{q^2}$ with $a,b\in\Bbb F_q$ was determined in a…

Number Theory · Mathematics 2014-04-08 Xiang-dong Hou

Let $f(X)=X(1+aX^{q(q-1)}+bX^{2(q-1)})\in\Bbb F_{q^2}[X]$, where $a,b\in\Bbb F_{q^2}^*$. In a series of recent papers by several authors, sufficient conditions on $a$ and $b$ were found for $f$ to be a permutation polynomial (PP) of $\Bbb…

Number Theory · Mathematics 2019-01-08 Xiang-dong Hou , Ziran Tu , Xiangyong Zeng

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…

Number Theory · Mathematics 2013-10-08 Michael Zieve

We determine all permutation polynomials over F_{q^2} of the form X^r A(X^{q-1}) where, for some Q which is a power of the characteristic of F_q, the integer r is congruent to Q+1 (mod q+1) and all terms of A(X) have degrees in {0, 1, Q,…

Number Theory · Mathematics 2022-03-09 Zhiguo Ding , Michael E. Zieve

Permutation polynomials over finite fields have extensive applications in various areas. Particularly, permutation polynomials with simple forms are of great interest. In recent papers, several classes of permutation polynomials of the form…

Number Theory · Mathematics 2025-12-29 Xuan Pang , Danyao Wu , Pingzhi Yuan

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

Information Theory · Computer Science 2013-08-28 Pingzhi Yuan , Cunsheng Ding

We determine all permutation trinomials of type $x^{2p^s+r}+x^{p^s+r}+\lambda x^r$ over the finite field $\mathbb{F}_{p^t}$ when $(2p^s+r)^4<p^t$. This partially extends a previous result by Bhattacharya and Sarkar in the case $p=2$, $r=1$.

Combinatorics · Mathematics 2017-05-19 Daniele Bartoli , Giovanni Zini

Let $q$ be a power of $2$. Recently, Tu and Zeng considered trinomials of the form $f(X)=X+aX^{(1/4)q^2(q-1)}+bX^{(3/4)q^2(q-1)}$, where $a,b\in\Bbb F_{q^2}^*$. They proved that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if…

Number Theory · Mathematics 2019-06-19 Xiang-dong Hou

Let $e$ be a positive integer, $p$ be an odd prime, $q=p^{e}$, and $\Bbb F_q$ be the finite field of $q$ elements. Let $f,g \in \Bbb F_q [X,Y]$. The graph $G=G_q(f,g)$ is a bipartite graph with vertex partitions $P=\Bbb F_q^3$ and $L=\Bbb…

Combinatorics · Mathematics 2015-07-21 Xiang-dong Hou , Stephen D. Lappano , Felix Lazebnik

Let $k$ be a positive integer and $S_{2k}={\tt x}+{\tt x}^4+...+{\tt x}^{4^{2k-1}}\in\Bbb F_2[{\tt x}]$. It was recently conjectured that ${\tt x}+S_{2k}^{4^{2k}}+S_{2k}^{4^k+3}$ is a permutation polynomial of $\Bbb F_{4^{3k}}$. In this…

Number Theory · Mathematics 2013-04-09 Xiang-dong Hou

Permutation polynomials with few terms attracts researchers' interest in recent years due to their simple algebraic form and some additional extraordinary properties. In this paper, by analyzing the quadratic factors of a fifth-degree…

Information Theory · Computer Science 2016-10-17 Nian Li

Let $q$ be a power of a prime and $\mathbb{F}_q$ be a finite field with $q$ elements. In this paper, we propose four families of infinite classes of permutation trinomials having the form $cx-x^s + x^{qs}$ over $\mathbb{F}_{q^2}$, and…

Information Theory · Computer Science 2018-05-29 Dabin Zheng , Mu Yuan , Long Yu

For each prime p other than 3, and each power q=p^k, we present two large classes of permutation polynomials over F_{q^2} of the form X^r B(X^{q-1}) which have at most five terms, where B(X) is a polynomial with coefficients in {1,-1}. The…

Number Theory · Mathematics 2025-01-09 Zhiguo Ding , Michael E. Zieve

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…

Information Theory · Computer Science 2016-06-15 Jingxue Ma , Tao Zhang , Tao Feng , Gennian Ge

We present several existence and nonexistence results for permutation binomials of the form $x^r(x^{q-1}+a)$, where $e\geq 2$ and $a\in \mathbb{F}_{q^e}^*$. As a consequence, we obtain a complete characterization of such permutation…

Number Theory · Mathematics 2022-02-11 Ariane M. Masuda , Ivelisse Rubio , Javier Santiago

In this paper, we investigate permutation polynomials over the finite field $\mathbb F_{q^n}$ with $q=2^m$, focusing on those in the form $\mathrm{Tr}(Ax^{q+1})+L(x)$, where $A\in\mathbb F_{q^n}^*$ and $L$ is a $2$-linear polynomial over…

Number Theory · Mathematics 2025-07-01 Ruikai Chen , Sihem Mesnager

In this paper we discuss the permutational property of polynomials of the form $f(L(x))+k(L(x))\cdot M(x)\in \mathbb F_{q^n}[x]$ over the finite field $\mathbb F_{q^n}$, where $L, M\in \mathbb F_q[x]$ are $q$-linearized polynomials. The…

Number Theory · Mathematics 2021-04-28 Lucas Reis , Qiang Wang

Let F_{q^n} be the field of order q^n, and let Tr be the trace map from F_{q^n} to its q-element subfield. We exhibit nine sequences of polynomials of the form f(x):=x+c*Tr(x^k), with c in F_{q^n}, such that for each polynomial the function…

Number Theory · Mathematics 2016-03-04 Gohar Kyureghyan , Michael Zieve

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