AN ANALOG OF THE PRIME NUMBER THEOREM FOR FINITE FIELDS VIA TRUNCATED POLYLOGARITHM EXPANSIONS

作者：Rebenich Niko^*; Gulliver T Aaron; Neville Stephen; Speidel Ulrich

来源：Mathematics of Computation, 2018, 87(310): 855-877.

DOI：10.1090/mcom/3247

• Lerch transcendent
• polylogarithm
• Eulerian polynomials
• divergent series
• superasymptotic expansion
• prime polynomial counting function
• irreducible polynomials
• aperiodic necklaces

An exponentially accurate asymptotic expansion of the truncated polylogarithm function is derived that leads to an asymptotic formula for enumerating monic irreducible polynomials over finite fields. This formula is analogous to the asymptotic expansion formula of the classical prime counting function. Results are presented which show that it is more accurate than previous results in the literature while requiring very little computational effort. Asymptotic expansions of the Lerch transcendent, Eulerian polynomials, and polylogarithms of negative integer order are also given. The accuracy of the proposed approach is verified via numerical results.

• 出版日期2018-3