Revisiting Gauss's analogue of the prime number theorem for polynomials over a finite field

DOI10.1016/j.ffa.2010.04.002zbMath1201.11109OpenAlexW2106713329MaRDI QIDQ982485

Paul Pollack

Publication date: 7 July 2010

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2010.04.002

zbMATH Keywords

finite fieldprime number theoremirreducible polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Distribution of primes (11N05)

Related Items (7)

Average values of \(L\)-series for real characters in function fields ⋮ Counting perfect polynomials ⋮ Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\) ⋮ An analog of the prime number theorem for finite fields via truncated polylogarithm expansions ⋮ On the discrepancy of generalized Niederreiter sequences ⋮ Irreducible Sobol’ sequences in prime power bases ⋮ Fractional derivative anomalous diffusion equation modeling prime number distribution

Cites Work

• A polynomial analogue of the twin prime conjecture
• The Distribution of Irreducibles in GF [ q,x ]
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Revisiting Gauss's analogue of the prime number theorem for polynomials over a finite field