turkmath.org

Generating function methods are commonly used for enumeration problems. For many counting problems, the structural properties of the combinatorial class yield a functional equation on the corresponding generating function. The Lagrange inversion theorem provides a powerful analytic method to obtain explicit expressions for the counting sequence from the functional equation satisfied by the generating function. I will discuss the proof of the Lagrange inversion theorem and present some applications of it.