This final year mathematics course aims to equip you to apply concepts in symbolic methods and analysis to solve a variety of problems in combinatorics. The tools developed in the course are useful for future graduate courses in mathematics, applied mathematics and engineering. Course Content 1. Combinatorial Structures and Ordinary Generating Functions: symbolic enumeration methods, integer compositions and partitions, words and regular languages, tree structures 2. Labelled Structures and Exponential Generating Functions: labelled classes, surjections, set partitions, words, alignments, permutations, labelled trees, mapping and graphs 3. Complex Analysis, Rational and Meromorphic Asymptotics: generating functions as analytic objects, analytic functions and meromorphic functions, singularities and exponential growth of coefficients 4. Singularity Analysis of Generating Functions: coefficient asymptotics, process of singularity analysis
Academic Units | 4 |
Exam Schedule | Not Applicable |
Grade Type | Letter Graded |
Department Maintaining | MATH(SPS) |
Prerequisites |
Index | Type | Group | Day | Time | Venue | Remark |
---|
0930
1030
1130
1230
1330
1430
1530
1630
1730
We would encourage you to review with the following template.
AY Taken: ...
Assessment (Optional): ...
Topics (Optional): ...
Lecturer (Optional): ...
TA (Optional): ...
Review: ...
Final Grade (Optional): ...