Dickman polylogarithms and their constants
arXiv:1004.0519
Abstract
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.
11 pages, LaTeX
References in corpus (10)
- Harmonic Polylogarithms
- The third-order QCD corrections to deep-inelastic scattering by photon exchange
- The Multiple Zeta Value Data Mine
- Association of multiple zeta values with positive knots via Feynman diagrams up to 9 loops
- The Two-Loop Hexagon Wilson Loop in N = 4 SYM
- Numerical Evaluation of Two-Dimensional Harmonic Polylogarithms
- Two-loop splitting functions in QCD
- Quantum Spin Chains and Riemann Zeta Function with Odd Arguments
- Quantum Correlations and Number Theory
- Full result for the three-loop static quark potential