Symbolic method (combinatorics): Difference between revisions

Revision as of 10:05, 20 December 2013

Revision as of 16:13, 6 February 2014

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 developed by [[Philippe Flajolet]],

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

ManyEarlier precursorscontributors ofto thesethe key ideas canand betechniques listed, among whichinclude [[Leonhard Euler]], [[Arthur Cayley]], [[Srinivasa Ramanujan]], [[George Pólya]], and [[Donald Knuth]].

== Classes of combinatorial structures ==