组合数学 (Fall 2025)/Generating functions: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

25 February 2025

  • curprev 12:0912:09, 25 February 2025 Etone talk contribs 25,549 bytes +25,549 Created page with "== Generating Functions == In Stanley's magnificent book ''Enumerative Combinatorics'', he comments the generating function as "the most useful but most difficult to understand method (for counting)". The solution to a counting problem is usually represented as some <math>a_n</math> depending a parameter <math>n</math>. Sometimes this <math>a_n</math> is called a ''counting function'' as it is a function of the parameter <math>n</math>. <math>a_n</math> can also be tre..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=组合数学_(Fall_2025)/Generating_functions"