
We examine the asymptotics of a sequence of lacunary binomial-type polynomials $\wp_n(z)$ as $n\rightarrow\infty$ that have arisen in the problem of the expected number of independent sets of vertices of finite simple graphs. We extend the recent analysis of Gawronski and Neuschel by employing the method of steepest descents applied to an integral representation. The case of complex $z$ with $|z|<1$ is also considered. Numerical results are presented to illustrate the accuracy of the resulting expansions.
10 pages, 3 figures
Mathematics - Classical Analysis and ODEs, Classical Analysis and ODEs (math.CA), FOS: Mathematics, 30E15, 41A60
Mathematics - Classical Analysis and ODEs, Classical Analysis and ODEs (math.CA), FOS: Mathematics, 30E15, 41A60
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
