Parity of the number of irreducible factors for composite polynomials

DOI10.1016/j.ffa.2009.12.002zbMath1200.11092OpenAlexW2008432412MaRDI QIDQ973959

Ryul Kim, Wolfram Koepf

Publication date: 26 May 2010

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

Full work available at URL: https://doi.org/10.1016/j.ffa.2009.12.002

zbMATH Keywords

finite fieldspolynomialsStickelberger's theoremSwan's theoremDiscriminant

Mathematics Subject Classification ID

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

Related Items (4)

Stickelberger and the Eigenvalue Theorem ⋮ Swan-like results for binomials and trinomials over finite fields of odd characteristic ⋮ Characterization of sporadic perfect polynomials over \(\mathbb{F}_2\) ⋮ On Mersenne polynomials over \(\mathbb{F}_2\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The parity of the number of irreducible factors for some pentanomials
• A Swan-like theorem
• A chain rule for the resultant of two polynomials
• Factorization of polynomials over finite fields
• Finding irreducible and primitive polynomials
• Primitive polynomials over finite fields of characteristic two
• On the parity of the number of irreducible factors of self-reciprocal polynomials over finite fields
• Swan's theorem for binary tetranomials
• Parallel multipliers based on special irreducible pentanomials
• Irreducible trinomials over finite fields
• Resultants and discriminants of Chebyshev and related polynomials

This page was built for publication: Parity of the number of irreducible factors for composite polynomials