Revision as of 17:41, 21 June 2013 edit 90.51.129.244 (talk) →References ← Previous edit		Revision as of 17:49, 21 June 2013 edit undo 90.51.129.244 (talk) No edit summary Next edit →
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 iswas ~~due~~mostly todevelopped by [[Philippe Flajolet]] , and is detailled 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]],... == Classes of combinatorial structures ==

Symbolic method (combinatorics): Difference between revisions