Math 2.0

Combinatorics Generating functions and asymptotics Concept

Symbolic method

Summary

The symbolic method translates a description of a combinatorial class into an equation for its generating function, see the definition. Each construction, such as disjoint union, pair or sequence, has a fixed rule that acts on generating functions. Unlabelled classes lead to ordinary generating functions, and labelled classes lead to exponential generating functions. It is the first part of analytic combinatorics, whose second part extracts asymptotics from the equations.

Further reading

  1. Web https://en.wikipedia.org/wiki/Symbolic_method_(combinatorics)
About this page
TagJP11D90EJC
URIm2://JP11D90EJC
Kindconcept
WritingW0 stub
MSC05A15
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (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