Revision as of 06:51, 12 January 2015 edit 2001:f18:113:22:c8c0:3065:8d4a:a60c (talk) →Boxed product ← Previous edit		Revision as of 06:41, 24 January 2015 edit undo Zaslav (talk \| contribs) Extended confirmed users 15,706 edits 'Analytic combinatorics" is a big subject and not due to one person. Flajolet has one approach to the subject, not the only one. 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]],~~ ~~Earlier contributors~~Contributors to the key ideas and techniques include [[Leonhard Euler]], [[Arthur Cayley]], [[Srinivasa Ramanujan]], [[George Pólya]], and [[Donald Knuth]].▼ ~~and~~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. ▲Earlier contributors to the key ideas and techniques include [[Leonhard Euler]], [[Arthur Cayley]], [[Srinivasa Ramanujan]], [[George Pólya]], and [[Donald Knuth]]. == Classes of combinatorial structures ==

Symbolic method (combinatorics): Difference between revisions