Symbolic method (combinatorics): Difference between revisions

Revision as of 01:46, 3 May 2018

Revision as of 11:29, 6 May 2018

Line 1:

{{About|the method in analytic combinatorics|the method in inveriant theory|Symbolic method}}

In mathematicscombinatorics, especially in analytic combinatorics, the '''symbolic method''' is a technique for [[enumerative combinatorics|counting combinatorial objects]]. It uses the internal structure of the objects to derive formulas for their [[generating function]]s. The method is mostly associated with [[Philippe Flajolet]],

and is detailed in Part A of his book with [[Robert Sedgewick (computer scientist)|Robert Sedgewick]], ''Analytic Combinatorics''.

Similar languages for specifying combinatorial classes and their generating functions are found in work by