Swan-like results for binomials and trinomials over finite fields of odd characteristic (Q648071): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10623-010-9476-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2028694851 / rank | |||
Normal rank |
Revision as of 00:44, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Swan-like results for binomials and trinomials over finite fields of odd characteristic |
scientific article |
Statements
Swan-like results for binomials and trinomials over finite fields of odd characteristic (English)
0 references
22 November 2011
0 references
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\).
0 references
Swan's theorem
0 references
discriminant
0 references
finite fields
0 references
number of factors of polynomials
0 references