Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle

DOI10.4169/MATH.MAG.84.5.369MaRDI QIDQ2911530zbMATH OpenOpenAlexWikidataFDO

Authors Sunil K. Chebolu, Ján Mináč

Publication date 31 August 2012

Published in Mathematics Magazine (Search for Journal in Brave)

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

zbMATH Keywords

finite fieldsGauss's formulainclusion-exclusion principleirreducible polynomials

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Elementary algebra (educational aspects) (97H20) Groups, rings, fields (educational aspects) (97H40)

Abstract: C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the shape of this formula and its proof instantly.

Recommendations

• Counting irreducible polynomials with prescribed coefficients over a finite field
• Counting irreducible polynomials over finite fields
• Counting irreducible factors of polynomials over a finite field
• On counting polynomials over finite fields
• Counting irreducible binomials over finite fields
• Number of Irreducible Polynomials in Several Variables over Finite Fields
• Counting polynomials over finite fields with given root multiplicities
• A note on the number of irreducible polynomials over finite fields
• scientific article; zbMATH DE number 4002228
• scientific article; zbMATH DE number 6515353

Cited in

(14)

• Counting irreducible factors of polynomials over a finite field
• Uniform probability and natural density of mutually left coprime polynomial matrices over finite fields
• On atomic density of numerical semigroup algebras
• A new lower bound on the family complexity of Legendre sequences
• Counting irreducible polynomials over finite fields
• A note on the number of irreducible polynomials over finite fields
• Counting irreducible polynomials of degree \(r\) over \(\mathbb F_{q^n}\) and generating Goppa codes using the lattice of subfields of \(\mathbb F_{q^{nr}}\)
• scientific article; zbMATH DE number 830028 (Why is no real title available?)
• A Tale of Two Cyclicities: Counting in Finite Cyclic Groups and Finite Fields
• Similarity classes of linear transformations
• Visibly irreducible polynomials over finite fields
• A classically efficient forgery of MPPK/DS signatures
• The asymptotic distribution of Elkies primes for reductions of abelian varieties is Gaussian
• Finite Fields

This page was built for publication: Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle

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