Symbolic method (combinatorics): Difference between revisions

Revision as of 15:08, 10 August 2006

Revision as of 03:13, 3 January 2007

Line 1:

'''Symbolic combinatorics''' is a technique of [[analytic combinatorics]] (a sub-branch of [[combinatorics]]) that uses symbolic representations of [[combinatorial class]]es to derive their [[generating function]]s.

The underlying mathematics, including the [[Polya enumeration theorem]], are explained on the page of the

[[Fundamentalfundamental theorem of combinatorial enumeration]].

==Procedure==