Asymptotics of Chebyshev-Stirling and Stirling numbers of the second kind
Wolfgang Gawronski, Lance L. Littlejohn, Thorsten Neuschel

TL;DR
This paper derives asymptotic formulas for Chebyshev-Stirling and classical Stirling numbers of the second kind using probabilistic methods, enhancing understanding of their behavior for large parameters.
Contribution
It introduces new asymptotic formulas for Chebyshev-Stirling numbers and extends the probabilistic approach to classical Stirling numbers, providing deeper insights.
Findings
Asymptotic formulas for Chebyshev-Stirling numbers derived
Probabilistic approach applicable to classical Stirling numbers
Enhanced asymptotic analysis for Stirling numbers of the second kind
Abstract
For the Chebyshev-Stirling numbers, a special case of the Jacobi-Stirling numbers, asymptotic formulae are derived in terms of a local central limit theorem. The underlying probabilistic approach also applies to the classical Stirling numbers of the second kind. Thereby a supplement of the asymptotic analysis for these numbers is established.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Mathematical functions and polynomials · Advanced Mathematical Identities
