Math 2.0

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

  1. Web https://en.wikipedia.org/wiki/Analytic_combinatorics
About this page
TagYJK71RKVEB
URIm2://YJK71RKVEB
Kindconcept
WritingW0 stub
MSC05A16, 05A15, 30B10
SpecializesEnumerative combinatorics
Same as
Changed2 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.

What links here

Definitions