Generating Functions
Generating functions are used to describe families of combinatorial objects. Let denote the family of objects and let F(x) be its generating function. Then:
Where denotes the number of combinatorial objects of size n. The number of combinatorial objects of size n is therefore given by the coefficient of . Some common operation on families of combinatorial objects and its effect on the generating function will now be developed. The exponential generating function is also sometimes used. In this case it would have the form:
Read more about this topic: Enumerative Combinatorics
Famous quotes containing the word functions:
“The English masses are lovable: they are kind, decent, tolerant, practical and not stupid. The tragedy is that there are too many of them, and that they are aimless, having outgrown the servile functions for which they were encouraged to multiply. One day these huge crowds will have to seize power because there will be nothing else for them to do, and yet they neither demand power nor are ready to make use of it; they will learn only to be bored in a new way.”
—Cyril Connolly (1903–1974)