Complete characterization of some permutation polynomials of the form \(x^r (1+ax^{s_1(q-1)}+bx^{s_2(q-1)})\) over \(\mathbb{F}_{q^2}\) (Q6110151)
From MaRDI portal
scientific article; zbMATH DE number 7720658
Language | Label | Description | Also known as |
---|---|---|---|
English | Complete characterization of some permutation polynomials of the form \(x^r (1+ax^{s_1(q-1)}+bx^{s_2(q-1)})\) over \(\mathbb{F}_{q^2}\) |
scientific article; zbMATH DE number 7720658 |
Statements
Complete characterization of some permutation polynomials of the form \(x^r (1+ax^{s_1(q-1)}+bx^{s_2(q-1)})\) over \(\mathbb{F}_{q^2}\) (English)
0 references
31 July 2023
0 references
Let \(p\) be a prime and \(q\) a power of \(p\). Let \(\mathbb{F}_q\) be the finite field with \(q\) elements. A polynomial \(f\in \mathbb{F}_q[x]\) is called a \textit{permutation polynomial} (PP) of \(\mathbb{F}_q\) if the associated mapping \(x\mapsto f(x)\) from \(\mathbb{F}_q\) to \(\mathbb{F}_q\) is a permutation of \(\mathbb{F}_q\). Permutation polynomials over finite fields have important applications in coding theory, cryptography, finite geometry, combinatorics and computer science, and among other fields. In the paper under review, the authors completely characterize all permutation trinomials of the form \(f(x)=x^3(1+ax^{q-1}+bx^{2(q-1)})\) over \(\mathbb{F}_{q^2}\), where \(a,b\in \mathbb{F}_q^*\), and all permutation trinomials of the form \(f(x)=x^3(1+bx^{2(q-1)}+cx^{3(q-1)})\) over \(\mathbb{F}_{q^2}\), where \(b,c\in \mathbb{F}_q^*\), in both even and odd characteristic cases. In the paper, the authors work on some types of permutation trinomials of the form \[f(x)=x^r(1+ax^{s_1(q-1)}+bx^{s_2(q-1)})\,\in\,\mathbb{F}_{q^2}[x],\] where \(r,s_1,s_2\) are positive integers, over the finite field \(\mathbb{F}_{q^2}\). They develop a method to characterize certain permutation polynomials completely. Their method starts with a polar coordinate transformation and then they use an algorithmic method to decide whether the resulting polynomial in two variables is irreducible or not. This algorithmic method allows them to obtain all permutation polynomials under consideration as follows: The ones which lead to factorizations are easy to decide whether they are permutations or not. The ones which are irreducible turn out not to be permutations by using the well known Hasse-Weil inequality. They apply their method to some classes of polynomials of the form \(x^r(1+ax^{s_1(q-1)}+bx^{s_2(q-1)})\) over \(\mathbb{F}_{q^2}\). In particular, they obtain not only new permutation polynomials over \(\mathbb{F}_{q^2}\) but also obtain a complete characterization.
0 references
permutation polynomials
0 references
finite fields
0 references
absolutely irreducible
0 references
0 references
0 references
0 references