Symbolic method (combinatorics): Difference between revisions

Revision as of 17:49, 21 June 2013

Revision as of 20:58, 23 June 2013

Line 1:

In mathematics, '''analytic combinatorics''' is one of the many techniques of [[enumerative combinatorics|counting combinatorial objects]]. It uses the internal structure of the objects to derive formulas for their [[generating function]]s, and then, it uses complex analysis techniques to get asymptotics. This particular theory was mostly developpeddeveloped by [[Philippe Flajolet]],

and is detailleddetailed in his book with [[Robert Sedgewick (computer scientist)|Robert Sedgewick]], ''Analytic Combinatorics''.

Many precursors of these ideas can be listed, among which [[Leonhard Euler]], [[Arthur Cayley]], [[Srinivasa Ramanujan]], [[George Pólya]], [[Donald Knuth]],...