Asymptotics of Some Convolutional Recurrences
Abstract
We study the asymptotic behavior of the terms in sequences satisfying recurrences of the form $a_n = a_{n-1} + \sum_{k=d}^{n-d} f(n,k) a_k a_{n-k}$ where, very roughly speaking, $f(n,k)$ behaves like a product of reciprocals of binomial coefficients. Some examples of such sequences from map enumerations, Airy constants, and Painlevé I equations are discussed in detail.
Published
2010-01-05
How to Cite
Bender, E. A., Daalhuis, A. B. O., Gao, Z., Richmond, L. B., & Wormald, N. (2010). Asymptotics of Some Convolutional Recurrences. The Electronic Journal of Combinatorics, 17(1), R1. https://doi.org/10.37236/273
Issue
Article Number
R1