Swan-like results for binomials and trinomials over finite fields of odd characteristic
Using a result of Stickelberger, \textit{R. G. Swan} has shown in [Pac. J. Math. 12, 1099--1106 (1962; Zbl 0113.01701)] that over a finite field \(F\) of odd order, the number of irreducible factors of a squarefree polynomial \(f\) is equivalent modulo \(2\) to the degree, if and only if the discriminant \(D(f)\) is a square. The authors observe that since \(D(x^n+a) = (-1)^{n(n-1)/2}n^na^{n-1}\), the parity of the number of factors can be easily determined from \(a\) and \(n\). The authors also examine the known formula for the discriminant of a trinomial \(x^n+ax^k+b\), and determine the parity of the number of irreducible factors over \(F\), whenever the discriminant is a monomial in \(n\), \(k\), \(a\) and \(b\).
- A note on the reducibility of binary affine polynomials
- A Swan-like theorem
- Efficient \(p\)th root computations in finite fields of characteristic \(p\)
- Factorization of polynomials over finite fields
- Factorization of trinomials over Galois fields of characteristic 2
- Integer factoring
- Irreducible trinomials over finite fields
- On the distribution of irreducible trinomials over \(\mathbb F_3\)
- Parity of the number of irreducible factors for composite polynomials
- Swan's theorem for binary tetranomials
- Ten new primitive binary trinomials
- The parity of the number of irreducible factors for some pentanomials
- Factorization of trinomials over Galois fields of characteristic 2
- On polynomials x^n-1 over binary fields whose irreducible factors are binomials and trinomials
- A Swan-like note for a family of binary pentanomials
- A note on the stability of trinomials over finite fields
- Swan's theorem for binary tetranomials
- A note on the reducibility of binary affine polynomials
- Irreducible trinomials over finite fields
- Monogenic reciprocal trinomials and their Galois groups
- Sudoku-like arrays, codes and orthogonality
- Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields
- Equal-degree factorization of binomials and trinomials over finite fields
- The 3-sparsity of X^n-1 over finite fields of characteristic 2
- A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields
- On the discriminant of a trinomial
- A Swan-like theorem
- Parity of the number of irreducible factors for composite polynomials
This page was built for publication: Swan-like results for binomials and trinomials over finite fields of odd characteristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648071)
