Revision as of 06:41, 24 January 2015 edit Zaslav (talk \| contribs) Extended confirmed users 15,711 edits 'Analytic combinatorics" is a big subject and not due to one person. Flajolet has one approach to the subject, not the only one. ← Previous edit		Revision as of 07:40, 24 January 2015 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,695 edits Undid revision 643922259 by Zaslav (talk) Do you have a source for calling Flajolet's work something different than what he called it? 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 was mostly developed by [[Philippe Flajolet]], ~~A particular approach called "symbolic combinatorics", recently developed by [[Philippe Flajolet]],~~and is detailed in his book with [[Robert Sedgewick (computer scientist)\|Robert Sedgewick]], ''Analytic Combinatorics''~~. This article is mostly about symbolic combinatorics~~.▼ ~~Contributors~~Earlier contributors to the key ideas and techniques include [[Leonhard Euler]], [[Arthur Cayley]], [[Srinivasa Ramanujan]], [[George Pólya]], and [[Donald Knuth]]. ▲A particular approach called "symbolic combinatorics", recently developed by [[Philippe Flajolet]], is detailed in his book with [[Robert Sedgewick (computer scientist)\|Robert Sedgewick]], ''Analytic Combinatorics''. This article is mostly about symbolic combinatorics. == Classes of combinatorial structures ==

Symbolic method (combinatorics): Difference between revisions