Concepts3
∑MathAdvanced
Generating Functions - EGF
Exponential generating functions (EGFs) encode a sequence (a_n) as A(x) = \sum_{n \ge 0} a_n \frac{x^n}{n!}, which naturally models labeled combinatorial objects.
#exponential generating function#egf#binomial convolution+11
∑MathAdvanced
Pólya Enumeration
Pólya Enumeration Theorem generalizes Burnside’s Lemma by turning counting under symmetry into a polynomial substitution problem.
#pólya enumeration#cycle index#burnside lemma+12
∑MathAdvanced
Generating Functions - OGF
An ordinary generating function (OGF) encodes a sequence (a_n) as a formal power series A(x) = \sum_{n \ge 0} a_n x^n.
#ordinary generating function#ogf#coefficient extraction+12