A note on constructing permutation polynomials (Q623234): Difference between revisions

Let \(H\) be a subgroup of order \(d\) in \(\mathbb F_q^*\). Starting with a polynomial \(T\) which maps \(\mathbb F_q\) into \(H\cup\{ 0\}\) and a polynomial \(f\) which maps \(H\) onto a coset \(Ha\), which satisfy certain simple conditions, the authors show that \(F(x)=x^s(x^{-s}f)(T(x))\) is a permutation polynomial. When \(q-1=nd\) and \(n\equiv 1\pmod{d}\) then \(T(x)=x^n\) satisfies the requirements and their construction yields some of the permutations of \textit{D. Wan} and \textit{R. Lidl} [Monatsh. Math. 112, No. 2, 149--163 (1991; Zbl 0737.11040)]. When \(n\not\equiv 1\pmod{d}\) then the authors show by example that their permutations are not of the Wan-Lidl form arise. If \(\mathbb F_{q'}\subset \mathbb F_q\) and \(H=\mathbb F_{q'}^*\) then the construction is a theorem on lifting permutation polynomials from \(\mathbb F_{q'}\) to \(\mathbb F_q\). They also give a second lifting theorem which is similar.