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

DOI10.1016/J.FFA.2010.04.002zbMATH Open1201.11109OpenAlexW2106713329MaRDI QIDQ982485FDOQ982485

Authors: 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

Recommendations

• Counting irreducible polynomials over finite fields
• The Erdős Theorem and the Halberstam Theorem in function fields
• An analog of the prime number theorem for finite fields via truncated polylogarithm expansions
• A polynomial analog of the Goldbach conjecture
• The distribution of primitive roots in finite fields

zbMATH Keywords

finite fieldprime number theoremirreducible polynomials

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A polynomial analogue of the twin prime conjecture
• The Distribution of Irreducibles in GF [ q,x ]
• Title not available (Why is that?)

Cited In (9)

• An analog of the prime number theorem for finite fields via truncated polylogarithm expansions
• Irreducible Sobol' sequences in prime power bases
• Fractional derivative anomalous diffusion equation modeling prime number distribution
• Average values of \(L\)-series for real characters in function fields
• On the discrepancy of generalized Niederreiter sequences
• Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)
• Counting perfect polynomials
• The polynomial analogue of a theorem of Rényi
• Title not available (Why is that?)

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

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