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
| AUs | 4.0 AUs |
| Grade Type | |
| Prerequisite | MH1101, MH1201, MH1301, MH1802 |
| Not Available To Programme | |
| Not Available To All Programme With | |
| Not Available As BDE/UE To Programme | |
| Not Available As Core To Programme | |
| Not Available As PE To Programme | |
| Mutually Exclusive With | |
| Not Offered As BDE | |
| Not Offered As Unrestricted Elective | |
| Exam |
Available Indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 930 | |||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 |