Science Fair Project Encyclopedia
Analytic combinatorics
Analytic combinatorics is a sub-branch of combinatorics that describes combinatorial classes using generating functions, which are often analytic functions, but sometimes formal power series.
Two types of generating functions are commonly used — ordinary and exponential generating functions.
An important technique for deriving generating functions is symbolic combinatorics.
Given a generating function, analytic combinatorics attempts to describe the asymptotic behavior of a counting sequence using algebraic techniques. This often involves analysis of the function's singularities.
Last updated: 08-09-2005 02:01:46
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details