Dickman polylogarithms and their constants

Details Dickman polylogarithms and their constants Dickman polylogarithms and their constants

2010-04-04

arxiv.org/abs/1004.0519v1

Physics

Mathematical Physics

11 pages, LaTeX

Scientific paper

The Dickman function F(alpha) gives the asymptotic probability that a large integer N has no prime divisor exceeding N^alpha. It is given by a finite sum of generalized polylogarithms defined by the exquisite recursion L_k(alpha)=- int_alpha^{1/k} dx L_{k-1}(x/(1-x))/x with L_0(alpha)=1. The behaviour of these Dickman polylogarithms as alpha tends to 0 defines an intriguing series of constants, C_k. I conjecture that exp(gamma z)/Gamma(1-z) is the generating function for sum_{k\ge0} C_k z^k. I obtain high-precision evaluations of F(1/k), for integers k<11, and compare the Dickman problem with problems in condensed matter physics and quantum field theory.

Affiliated with

Also associated with

No associations

Rating

Dickman polylogarithms and their constants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dickman polylogarithms and their constants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dickman polylogarithms and their constants will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-448917