Abstract
We examine the asymptotics of a sequence of lacunary binomial-type polynomials as 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 with is also considered. Numerical results are presented to illustrate the accuracy of the resulting expansions.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.