Further results on a class of permutation trinomials (Q6110154): Difference between revisions

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 investigate the permutation property of the trinomial \(x^{(p-1)q+1}+\alpha x^{pq}+x^{q+p-1}\) over \(\mathbb{F}_{q^2}\), where \(\alpha\in \mathbb{F}_q^*\), and \(q=p^k\), where \(k\) is a positive integer. The authors prove that for \(p=7, \alpha\in \mathbb{F}_q^*\) and \(k>1\), the trinomial \(x^{6q+1}+\alpha x^{7q}+x^{q+6}\) is a permutation polynomial over \(\mathbb{F}_{q^2}\) if and only if \(\alpha=-1\) and \(k=2\). The authors also prove that for \(p>3\), \(\alpha\in \mathbb{F}_q^*\) and \(k=1\), the trinomial \(x^{(p-1)q+1}+\alpha x^{pq}+x^{q+p-1}\) is a permutation polynomial over \(\mathbb{F}_{q^2}\) if and only if \(\alpha = -3\).