Content deleted Content added
Eric Rowland (talk | contribs) Mark some unsupported claims about the supposed main players. Also, 'untimely' is not really an objective word that belongs in an encyclopedia. |
m Dating maintenance tags: {{Citation needed}} |
||
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 complex analysis techniques to get asymptotics. This particular theory was mostly developed by [[Philippe Flajolet]]{{Citation needed|date=October 2015}},
and is detailed in his book with [[Robert Sedgewick (computer scientist)|Robert Sedgewick]], ''Analytic Combinatorics''.
Earlier contributors to the key ideas and techniques include [[Leonhard Euler]], [[Arthur Cayley]], [[Srinivasa Ramanujan]], [[George Pólya]], and [[Donald Knuth]]. After Flajolet's death, Wojciech Szpankowski is largely responsible for further developments.{{Citation needed|date=October 2015}}
== Classes of combinatorial structures ==
| |||