University of Melbourne
The subject is about the use of generating functions for enumeration of combinatorial structures, including partitions of numbers, partitions of sets, permutations with restricted cycle structure, connected graphs, and other types of graph. The subject covers the solution of recurrence relations, methods of asymptotic enumeration, and some applications in statistical mechanics. The methods covered have widespread applicability, including in areas of pure and applied mathematics and computer science.
📌 课程信息来源于 Melbourne University Handbook,选课建议为 AI 生成仅供参考。请以官方 Handbook 为准。
数据更新时间:2026 年 2 月 | WhiteMirror 不对信息准确性承担责任