Counting polynomials with a given number of zeros in a finite field

DOI10.1080/03081089008817985zbMath0699.12028OpenAlexW2028996559MaRDI QIDQ3476922

Arnold Knopfmacher, John Knopfmacher

Publication date: 1990

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081089008817985

zbMATH Keywords

multiplicitynumber of zerosvariancemonic polynomialsaveragecounting functions

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Related Items (10)

On the computation of rational points of a hypersurface over a finite field ⋮ On the enumeration of polynomials with prescribed factorization pattern ⋮ Counting polynomials over finite fields with prescribed leading coefficients and linear factors ⋮ On the spectrum of Wenger graphs ⋮ The distribution of values of polynomials over a finite field ⋮ Counting polynomials with distinct zeros in finite fields ⋮ Characterization and enumeration of good punctured polynomials over finite fields ⋮ Factoring polynomials over finite fields: A survey ⋮ Counting irreducible factors of polynomials over a finite field ⋮ Analysis of Rabin's irreducibility test for polynomials over finite fields

Cites Work

• Unnamed Item
• Note on the mean value of $V \left( f \right)$
• The values of a polynomial over a finite field

This page was built for publication: Counting polynomials with a given number of zeros in a finite field