Counting irreducible polynomials over finite fields

DOI10.1007/S10587-010-0055-XzbMATH Open1224.11086OpenAlexW1970269633MaRDI QIDQ3073516FDOQ3073516

Authors: Qichun Wang, Haibin Kan 

Publication date: 11 February 2011

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/38047

Recommendations

• Counting irreducible factors of polynomials over a finite field
• Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle
• Counting irreducible polynomials with prescribed coefficients over a finite field
• Irreducible polynomials over finite fields. I
• Number of Irreducible Polynomials in Several Variables over Finite Fields
• On counting polynomials over finite fields
• Publication:4724729
• A note on the number of irreducible polynomials over finite fields
• Counting irreducible binomials over finite fields
• Irreducible polynomials over a finite field

zbMATH Keywords

finite fieldsresiduedistribution of irreducible polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55) Asymptotic results on counting functions for algebraic and topological structures (11N45)

Cites Work

• Title not available (Why is that?)
• Ein Analogon zum Primzahlsatz für algebraische Funktionenkörper. (An analog of the prime number theorem for algebraic function fields)

Cited In (18)

• An analog of the prime number theorem for finite fields via truncated polylogarithm expansions
• An uncertainty principle for function fields
• Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle
• Applications of the large sieve inequality for \(\mathbb{F}_q[T]\)
• On irreducibles in the polynomial semigroup
• Properties of a family of cryptographic Boolean functions
• Théorèmes de densité dans $F_q[X]$
• Irregularities in the Distribution of Irreducible Polynomials
• 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}}\)
• Résidus quadratiques dans F_q[T]
• A note on the number of irreducible polynomials over finite fields
• The prime number theorem and Dirichlet's theorem and irreducible polynomials with the least norm for \(\mathbb F_q[x]\)
• On the number of irreducible polynomials inF_q[x] of special form
• The estimated number of irreducible binomials
• Counting irreducible factors of polynomials over a finite field
• Revisiting Gauss's analogue of the prime number theorem for polynomials over a finite field
• Some notes on Dirichlet's theorem on primes in arithmetic progressions
• Irreducible polynomials over finite fields. I

This page was built for publication: Counting irreducible polynomials over finite fields

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