A Swan-like theorem

DOI10.1016/j.ffa.2005.02.001zbMath1105.11040arXivmath/0406538OpenAlexW1974056070MaRDI QIDQ814767

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

polynomialsfactorizationdiscriminantStickelberger's theorempentanomial

Mathematics Subject Classification ID

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

Related Items (8)

A note on the reducibility of binary affine polynomials ⋮ The parity of the number of irreducible factors for some pentanomials ⋮ 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 ⋮ Parity of the number of irreducible factors for composite polynomials ⋮ On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\) ⋮ A Swan-like note for a family of binary pentanomials ⋮ Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic

Cites Work

• Factorization of polynomials over finite fields
• On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\)
• A Generalization of Swan's Theorem
• Unnamed Item

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