Some counting problems are difficult to solve by a direct approach. For example, we often want to count the number of elements in a set that have a certain property. Euler and Laplace introduced generating functions that can often help. At first sight it might appear as a mere change of representation, but solutions using generating functions can be surprisingly effective. In the next chapter, we will see how generating functions can help solving recurrence relations.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Generating Functions

  • Andreas Klappenecker,
  • Hyunyoung Lee

摘要

Some counting problems are difficult to solve by a direct approach. For example, we often want to count the number of elements in a set that have a certain property. Euler and Laplace introduced generating functions that can often help. At first sight it might appear as a mere change of representation, but solutions using generating functions can be surprisingly effective. In the next chapter, we will see how generating functions can help solving recurrence relations.