Analytic combinatorics

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Analytic combinatorics uses techniques from complex analysis to solve problems in enumerative combinatorics, specifically to find asymptotic estimates for the coefficients of generating functions.

Analytic combinatorics uses techniques from complex analysis to solve problems in enumerative combinatorics, specifically to find asymptotic estimates for the coefficients of generating functions. If h(z) = \frac{f(z)}{g(z)} is a meromorphic function and a is its pole closest to the origin with order m , then [z^n] h(z) \sim \frac{(-1)^m m f(a)}{a^m g^{(m)}(a)} \left( \frac{1}{a} \right)^n n^{m-1} \quad as n \to \infty where [z^n] h(z) is the coefficient of z^n in the Taylor expansion of h(z) around z=0 . [z^n](1 - z)^\beta f(z) = \sum_{j=0}^m f_j \frac{n^{-\beta-j-1}}{\Gamma(-\beta-j)} + O(n^{-m-\beta-2}) See Szegő (1975) for a similar theorem dealing with multiple singularities. where F^'(\zeta) = 0 . See also the method of steepest descent.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1361676427 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.