Generators for groups of permutation polynomials over finite fields
Let \(\mathrm{GF}(q)\) denote the finite field of \(q=p^2\) elements, \(q>2\) and \(S_q\) and \(A_q\) the symmetric and alternating groups, respectively, on \(q\) letters. In [Proc. Am. Math. Soc. 4, 538 (1953; Zbl 0052.03704)] \textit{L. Carlitz} proved that \(S_q\) is generated by \(x^{q-2}\), \(\alpha x+\beta\) with \(\alpha,\beta \in\mathrm{GF}(q)\), \(\alpha\neq 0\). \textit{L. E. Dickson} [Ann. Math. 11, 65--120 (1896; JFM 28.0135.03)] had previously proved this for \(q=7\) by using his list of all permutation polynomials of degree \(\leq 6\) for all \(\mathrm{GF}(q)\). The present paper contains a number of new theorems concerning generators of \(S_q\) and certain of its subgroups, where elements of \(S_q\) are represented by permutation polynomials on \(\mathrm{GF}(q)\). First, Carlitz's result is sharpened to: Theorem 4.2. \(S_q\) is generated by \(x+1\), \(x^{q-2}\) and \(\rho x\), where \(\rho\) is any primitive root of \(\mathrm{GF}(q)\). Then it is shown tha \[ L_q=\{\alpha x+\beta \mid\alpha,\beta \in\mathrm{GF}(q),\;\alpha\neq 0\},\quad AL_q=\{\alpha^2 x+\beta \mid\alpha,\beta \in\mathrm{GF}(q),\;\alpha\neq 0\}, \;\text{and} \] \[ Q_q=\{(x^{q-2}+\alpha)^{q-2}\mid\alpha \in\mathrm{GF}(q)\} \] are subgroups of \(S_q\) of orders \(q(q-1)\), \(\tfrac12 q(q-1)\) (if \(q\) is odd) and \(q\), respectively. Theorem 4.4. \(L_q\) is generated by \(\rho x\) and \(x+1\). \(AL_q\) is generated by \(\rho^2 x\) and \(x+1\). \(Q_q\) may be obtained from \((x^{q-2}+1)^{q-2}\) and \(\rho^2 x\). Furthermore, \(AL_q\subseteq L_q\), \(Q_q\subseteq A_q\). Also, Theorem 4.7. \(A_q\) is generated by its subgroups \(AL_q\) and \(Q_q\). The fact that \(AL_q\) and \(\alpha x^{q-2}\) generate \(A_q\) whenever \(\alpha x^{q-2}\) is an even permutation is deduced independently by a method resembling \textit{K. D. Fryer}'s proof [Proc. Am. Math. Soc. 6, 1--2 (1955; Zbl 0065.02401)] of a set of generators for \(A_p\), \(p\) an odd prime. A number of theorems on generators of \(S_{q+1}\) and \(A_{q+1}\) are proved by using the device of extending \(\mathrm{GF}(q)\) by addition of an element \(\infty\) and using \textit{L. Carlitz}'s result [Duke Math. J. 29, 325--332 (1962; Zbl 0196.31102)] that every permutation of the extended domain is representable in the form \(g(t(x))\) where \(g\) is a polynomial over \(\mathrm{GF}(q)\) and \(t\) is an element of the general linear fractional group of functions over the extended domain. A typical result is: Theorem 7.3. \(S_{q+1}\) is generated by \(1/x\), \(x^{q-2}\), \(\rho x\) and \(x+1\).
- Permutation polynomials and group permutation polynomials
- On a theorem of Carlitz
- On several permutation polynomials over \({F_{q^2}}\)
- On a conjecture of Fernando, Hou and Lappano concerning permutation polynomials over finite fields
- Permutation polynomials of the form \(x^r f(x^{(q-1)/d)}\) and their group structure
- Permutation polynomials of degree 6 or 7 over finite fields of characteristic 2
- A note regarding permutation binomials over \(\mathbb{F}_{q^2}\)
- scientific article; zbMATH DE number 1443333
- A general construction of permutation polynomials of \(\mathbb{F}_{q^2}\)
- Connecting two types of representations of a permutation of \(\mathbb{F}_q\)
- Groups of permutation polynomials over finite fields
- Connecting two types of representations of a permutation of \(\mathbb{F}_q\)
- On a theorem of Carlitz
- scientific article; zbMATH DE number 496023 (Why is no real title available?)
- scientific article; zbMATH DE number 663666 (Why is no real title available?)
- A general representation theory for constructing groups of permutation polynomials
- scientific article; zbMATH DE number 1443333 (Why is no real title available?)
This page was built for publication: Generators for groups of permutation polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5560334)