On the asymptotics of a sequence of lacunary binomial-type polynomials

Abstract

We examine the asymptotics of a sequence of lacunary binomial-type polynomials n(z) as n→∞ 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…