A Swan-like theorem

DOI10.1016/J.FFA.2005.02.001MaRDI QIDQ814767zbMATH OpenOpenAlexFDO

Authors Antonia Wilson Bluher

Publication date 7 February 2006

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0406538

zbMATH Keywords

discriminantfactorizationpolynomialsStickelberger's theorempentanomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)

Abstract: Richard G. Swan proved in 1962 that trinomials x^{8k} + x^m + 1 with 8k > m have an even number of irreducible factors, and so cannot be irreducible. In fact, he found the parity of the number of irreducible factors for any square-free trinomial in F_2[x]. We prove a result that is similar in spirit. Namely, suppose n is odd and f(x) = x^n + Sum_{i in S} x^i + 1 in F_2[x], where S subset {i : i odd, i < n/3} Union {i : i = n (mod 4), i < n} We show that if n = +-1 (mod 8) then f(x) has an odd number of irreducible factors, and if n = +=3 (mod 8) then f(x) has an even number of irreducible factors. This has an application to the problem of finding polynomial bases {1,a,a^2,...a^{n-1}} of F_{2^n} such that Tr(a^i) = 0 for all 1 <= i < n.

Recommendations

• A Generalization of Swan's Theorem
• Swan-like results for binomials and trinomials over finite fields of odd characteristic
• Swan's theorem for binary tetranomials
• Irreducible trinomials over finite fields
• Swan-like reducibility for type I pentanomials over a binary field

Cites work

• scientific article; zbMATH DE number 1943107 (Why is no real title available?)
• A Generalization of Swan's Theorem
• Factorization of polynomials over finite fields
• On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\)

Cited in

(13)

• scientific article; zbMATH DE number 1943107 (Why is no real title available?)
• A Swan-like note for a family of binary pentanomials
• On the discriminant of a trinomial
• A note on the reducibility of binary affine polynomials
• Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic
• A Generalization of Swan's Theorem
• Parity of the number of irreducible factors for composite polynomials
• Swan-like reducibility for type I pentanomials over a binary field
• On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\)
• The parity of the number of irreducible factors for some pentanomials
• Swan's theorem for binary tetranomials
• Swan-like results for binomials and trinomials over finite fields of odd characteristic
• On the parity of the number of irreducible factors of self-reciprocal polynomials over finite fields

This page was built for publication: A Swan-like theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814767)