Combinatorics Generating functions and asymptotics Concept
Analytic combinatorics
Summary
Analytic combinatorics finds the asymptotic size of combinatorial counts from their generating functions, see the definition. It views a generating function as a function of a complex variable. The singularities closest to the origin decide the exponential growth of the coefficients, and the type of these singularities decides the correction factor. Together with the symbolic method, it is the subject of the book "Analytic Combinatorics" by Philippe Flajolet and Robert Sedgewick.
Further reading
About this page
| Tag | YJK71RKVEB |
|---|---|
| URI | m2://YJK71RKVEB |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05A16, 05A15, 30B10 |
| Specializes | Enumerative combinatorics |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.