On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials (Q2031633)

This paper is concerned with the factorization of binomials of the form \(x^n-1\) over finite fields of characteristic \(2\). \textit{F. E. Brochero Martínez} et al. [Des. Codes Cryptography 77, No. 1, 277--286 (2015; Zbl 1329.11128)] proved that all the irreducible factors of \(x^n - 1\) over a finite field \(\mathbb{F}_{q}\) are binomials and trinomials, under the hypothesis that each prime factor of \(n\) divides \(q^2 - 1\). The authors of the present paper consider the factorization of \(x^n-1\) over \(\mathbb{F}_{2}\) and \(\mathbb{F}_{\!4}\). One the one hand, they prove that its irreducible factors over \(\mathbb{F}_{2}\) are all binomials and trinomials if and only if \(n = 3^k\) or \(n = 7^k\) for some positive integer \(k\). One the other hand, they prove that its irreducible factors over \(\mathbb{F}_{4}\) are all binomials and trinomials if and only if \[ n\in \{3^k, 5^k, 7^k, 3^m\cdot5^k, 3\cdot 7^k\} \] where \(k, m\) are positive integers. Furthermore, in both cases they provide the explicit factorization of \(x^n - 1\). The proofs of these results rely on basic combinatorial arguments, combined with classical results on cyclotomic polynomials and irreducible trinomials over binary fields.