Dickson polynomials and irreducible polynomials over finite fields (Q1336063): Difference between revisions

For the finite field of order \(q\), \(\mathbb{F}_ q\), let \[ D_ n(x,a)= \sum_{j=0}^{\lfloor n/2\rfloor} {\textstyle {n \over {n-j}}} \left( \begin{smallmatrix} n-j\\ j\end{smallmatrix} \right) (-a)^ j x^{n-2j} \] denote the Dickson polynomial of degree \(n\) with parameter \(a\in \mathbb{F}_ q\). It is determined when the Dickson polynomial \(D(x,a)+b\), \(a,b\in \mathbb{F}_ q\) is irreducible over \(\mathbb{F}_ q\). Several constructions of irreducible polynomials over \(\mathbb{F}_ q\) from Dickson polynomials are given. \textit{S. Chowla} and \textit{H. Zassenhaus} [Norske Vid. Selsk. Forhdl. 41, 34-35 (1968; Zbl 0186.092)] conjecture that if \(f(x)\) has integral coefficients and degree at least two and \(p\) is a sufficiently large prime for which \(f(x)\) does not permute \(\mathbb{F}_ p\), then there is an element \(c\in \mathbb{F}_ p\) so that \(f(x)+ c\) is irreducible over \(\mathbb{F}_ p\). It is shown here that this conjecture is false. Finally, it is shown how minimal polynomials of elements which generate one type of optimal normal bases can be derived from Dickson polynomials.