Counting irreducible factors of polynomials over a finite field

DOI10.1016/0012-365X(93)90227-KzbMath0785.11055MaRDI QIDQ1210556

John Knopfmacher, Arnold Knopfmacher

Publication date: 30 August 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

finite fieldvarianceaverage numbernumber of distinct irreducible factorsnumber of polynomials with a given number of irreducible factors of a fixed degreetotal number of monic polynomials of fixed degree

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Related Items

Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields, On the enumeration of polynomials with prescribed factorization pattern, On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X\)], Univariate polynomial factorization over finite fields, On the number of irreducible factors with a given multiplicity in function fields, Factoring polynomials over finite fields: A survey, Analysis of Rabin's irreducibility test for polynomials over finite fields, Some results on counting roots of polynomials and the Sylvester resultant, Enumerating \(D_4\) quartics and a Galois group bias over function fields, On the degrees of irreducible factors of polynomials over a finite field, Polynomial factorization over ${\mathbb F}_2$

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gaussian limiting distributions for the number of components in combinatorial structures
• Second-order terms for the variances and covariances of the number of prime factors-including the square free case
• Counting polynomials with a given number of zeros in a finite field
• Polynomials with Irreducible Factors of Specified Degree
• Further Arithmetical Functions in Finite Fields