Analytic combinatorics

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

  1. ^ Melczer 2021, pp. vii and ix.
  2. ^ Pemantle and Wilson 2013, pp. xi.
  3. ^ Flajolet and Sedgewick 2009, pp. ix.

From Wikipedia, the free encyclopedia · View on Wikipedia

Developed by Tubidy