 | This article needs attention from an expert in Mathematics. Please add a reason or a talk parameter to this template to explain the issue with the article. (January 2024) |
Analytic combinatorics uses techniques from complex analysis to solve problems in enumerative combinatorics, specifically to find asymptotic estimates for the coefficients of generating functions.
One of the earliest uses of analytic techniques for an enumeration problem came from Srinivasa Ramanujan and G. H. Hardy's work on integer partitions, starting in 1918, first using a Tauberian theorem and later the circle method.
Walter Hayman's 1956 paper "A Generalisation of Stirling's Formula" is considered one of the earliest examples of the saddle-point method.
In 1990, Philippe Flajolet and Andrew Odlyzko developed the theory of singularity analysis.
In 2009, Philippe Flajolet and Robert Sedgewick wrote the book Analytic Combinatorics, which presents analytic combinatorics with their viewpoint and notation.
Some of the earliest work on multivariate generating functions started in the 1970s using probabilistic methods.
Development of further multivariate techniques started in the early 2000s.
If is a meromorphic function and is its pole closest to the origin with order , then
where is the coefficient of in the Taylor expansion of around .
If
where and is a slowly varying function, then
See also the Hardy–Littlewood Tauberian theorem.
For generating functions with logarithms or roots, which have branch singularities.
If we have a function where and has a radius of convergence greater than and a Taylor expansion near 1 of , then
See Szegő (1975) for a similar theorem dealing with multiple singularities.
If has a singularity at and
where then
For generating functions including entire functions.
Intuitively, the biggest contribution to the contour integral is around the saddle point and estimating near the saddle-point gives us an estimate for the whole contour.
If is an admissible function, then
where .
See also the method of steepest descent.
As of 4th November 2023, this article is derived in whole or in part from Wikibooks. The copyright holder has licensed the content in a manner that permits reuse under CC BY-SA 3.0 and GFDL. All relevant terms must be followed.
![{\displaystyle [z^{n}]h(z)\sim {\frac {(-1)^{m}mf(a)}{a^{m}g^{(m)}(a)}}\left({\frac {1}{a}}\right)^{n}n^{m-1}\quad }](https://wikimedia.org/api/rest_v1/media/math/render/svg/14b53963c87bb063af8ec91817a33bfe6ddfe15e)
![{\displaystyle [z^{n}]h(z)}](https://wikimedia.org/api/rest_v1/media/math/render/svg/18db8846cf100d1f24ea4b43aff251b598e702cd)
![{\displaystyle [z^{n}]f(z)\sim {\frac {n^{\sigma -1}}{\Gamma (\sigma )}}L(n)\quad }](https://wikimedia.org/api/rest_v1/media/math/render/svg/891e51f21ed5123bb84b98fe1cf4973c179489f8)
^{\beta }f(z)=\sum _{j=0}^{m}f_{j}{\frac {n^{-\beta -j-1}}{\Gamma (-\beta -j)}}+O(n^{-m-\beta -2})}](https://wikimedia.org/api/rest_v1/media/math/render/svg/59ebdc6be74262b8d77bdc7959a202c9dfe0a11e)
![{\displaystyle [z^{n}]f(z)\sim \zeta ^{-n}{\frac {n^{-\alpha -1}}{\Gamma (-\alpha )}}(\log n)^{\gamma }(\log \log n)^{\delta }\quad }](https://wikimedia.org/api/rest_v1/media/math/render/svg/2993654acf8af67ff29bc5c13871db2d1626c720)
![{\displaystyle [z^{n}]F(z)\sim {\frac {F(\zeta )}{\zeta ^{n+1}{\sqrt {2\pi f^{''}(\zeta )}}}}\quad }](https://wikimedia.org/api/rest_v1/media/math/render/svg/c2f8fa94dcd8f02c2e6955e82672c8eae434d899)
