The author investigates the asymptotic behaviour of the number of irreducible polynomials over a finite field in arithmetic progressions. The main result is a version of the prime number theorem with remainder term extending on earlier result of \textit{D. Hensley} [Pac. J. Math. 123, 93--101 (1986; Zbl 0582.12010)]. The proof runs along classical lines using suitable \(L\)-series.
Recommendations
- Ensembles de polynômes irréductibles et théorèmes de densité
- Counting irreducible polynomials over finite fields
- The distribution of irreducible polynomials in \(\mathbb{F}_q[t]\)
- The prime number theorem and Dirichlet's theorem and irreducible polynomials with the least norm for \(\mathbb F_q[x]\)
- scientific article; zbMATH DE number 2186395
Cites work
Cited in
(6)- Applications of the large sieve inequality for \(\mathbb{F}_q[T]\)
- On semigroups having \(n^ 2\) essentially \(n\)-ary polynomials
- scientific article; zbMATH DE number 2186395 (Why is no real title available?)
- scientific article; zbMATH DE number 4134340 (Why is no real title available?)
- On nearly abelian polynomial semigroups
- ON THE IRREDUCIBLE COMPONENTS OF A SEMIALGEBRAIC SET
This page was built for publication: On irreducibles in the polynomial semigroup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996723)