"An asymptotic behavior of Li−n(a) for n-> inf Suppose a,b in (0,1). I'm interested in comparison of an asymptotic behavior of Li−n(a) and Li−n(b) for n-> inf. Such functions exhibit approximately factorial-like (faster than exponential) growth rate. The particular case Li−n(12) for n>=1 gives (up to a coefficient) a combinatorial sequence called Fubini numbers or orderded Bell numbers[1][2][3] (number of outcomes of a horse race provided that ties are possible).
mydaruma25
Answered question
2022-09-17
An asymptotic behavior of for Suppose . I'm interested in comparison of an asymptotic behavior of and for . Such functions exhibit approximately factorial-like (faster than exponential) growth rate. The particular case for gives (up to a coefficient) a combinatorial sequence called Fubini numbers or orderded Bell numbers[1][2][3] (number of outcomes of a horse race provided that ties are possible). This sequence is known to have the following asymptotic behavior:
After some numerical exprerimentation I conjectured the following behavior:
for arbitrarily large N (so, the remainder term decays faster than any negative power of n). It looks like the remainder term is oscillating with exponentially decreasing amplitude, but I haven't yet found the exact exponent base or asymptotic oscillation frequency. Could you suggest a proof of (2) or further refinements of this formula?
Answer & Explanation
Alec Reid
Beginner2022-09-18Added 9 answers
This is quite bizarre, but I believe that I can prove that your equation holds with the desired error term for any
The asymptotic that I give for only holds when By definition, for a<1
and we can approximate this sum by the integral
Letting the integral becomes
and so
Let's prove this with an exact error term by making the first step precise. Let / Then since
for all k<n, Euler-Maclaurin summation up to for even n implies that
Thus,
and so
and using the fact that l , this implies implies that