Combinatorics Generating functions and asymptotics Concept
Generating function
Summary
A generating function encodes a sequence as the coefficients of a formal power series. It turns counting problems into algebra with series. The node generating function gives the precise definition.
Where this leads
9 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Generating_function, Ordinary generating function (OGF)
About this page
| Tag | 0PHAC833JF |
|---|---|
| URI | m2://0PHAC833JF |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05A15 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Definitions
Special cases
Used by
- Symbolic method
- Solution of recurrences by generating functions
- Z-transform as a generating function
- Lagrange inversion theorem
- Gegenbauer polynomials
- Enumerative combinatorics
- Neumann's addition theorem
- Analytic combinatorics