Two new classes of permutation trinomials over \(\mathbb{F}_{q^3}\) with odd characteristic (Q6080561): Difference between revisions

Let \(p\) be a prime, \(q\) a power of \(p\), \(\mathbb{F}_q\) denote the finite field with \(q\) elements, and \(\mathbb{F}_q^*\) denote the multiplicative group of \(\mathbb{F}_q\). 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 present two classes of permutation trinomials of \(\mathbb{F}_{q^3}\) for an arbitrary odd characteristic based on the multivariate method and some subtle manipulation of solving equations with low degrees over finite fields. Moreover, the authors demonstrate that these two classes of permutation trinomials are quasi-multiplicative (QM) inequivalent to all known permutation polynomials over \(\mathbb{F}_{q^3}\). The main results of the paper are the following two theorems. \textbf{Theorem 1} Let \(q\) be an odd prime power and \(a,b\in \mathbb{F}_{q^3}^*\). Then \[f_1(x)=ax^{q(q^2-q+1)}+bx^{q^2-q+1}+2x\] is a permutation polynomial of \(\mathbb{F}_{q^3}\) if one of the following conditions is satisfied: \begin{itemize} \item[1.] \(ab=1\) and \(a^{q^2+q+1}\neq -1\); \item[2.] \(ab\in \mathbb{F}_q^*\setminus \{1\}\) and \(a^{q^2+q+1}+2ab+b^{q^2+q+1}=0\). \end{itemize} \textbf{Theorem 2} Let \(q\) be an odd prime power and \(a,b\in \mathbb{F}_{q^3}^*\). Then \[f_2(x)=x^{q^2-q+1}+ax^{q^2}+bx\] is a permutation polynomial of \(\mathbb{F}_{q^3}\) if one of the following conditions is satisfied: \begin{itemize} \item[1.] \(a^qb=1\) and \(a^{q^2+q+1}\neq 1\); \item[2.] \(a^qb\in \mathbb{F}_q^*\setminus \{1\}\) and \(a^{q^2+q+1}-2a^qb+b^{q^2+q+1}=0\). \end{itemize}