The asymptotics of the Touchard polynomials
R B Paris

TL;DR
This paper investigates the asymptotic behavior of Touchard polynomials for large degrees and complex arguments, using steepest descents and saddle point analysis to derive accurate expansions.
Contribution
It provides a detailed asymptotic analysis of Touchard polynomials for large n and complex z, including the influence of saddle points and numerical validation.
Findings
Asymptotic expansions depend on the number of contributing saddle points.
Method of steepest descents effectively derives expansions for large n and complex z.
Numerical results confirm the accuracy of the asymptotic approximations.
Abstract
We examine the asymptotic expansion of the Touchard polynomials (also known as the exponential polynomials) for large and complex values of the variable . In our treatment may be finite or allowed to be large like . We employ the method of steepest descents to a suitable integral representation of and find that the number of saddle points that contribute to the expansion depends on the values of and . Numerical results are given to illustrate the accuracy of the various expansions.
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
TopicsMathematical functions and polynomials · Polynomial and algebraic computation · Mathematics and Applications
