Note: This is an archived Handbook entry from 2015.
|Dates & Locations:|| |
This subject has the following teaching availabilities in 2015:Semester 1, Parkville - Taught on campus.
Timetable can be viewed here. For information about these dates, click here.
|Time Commitment:||Contact Hours: 36 hours comprising three 1-hour lectures per week. |
Total Time Commitment:
The following, or equivalent.
Study Period Commencement:
Semester 1, Semester 2
|Recommended Background Knowledge:|| |
Use of mathematical symbolic computation packages such as Mathematica and Maple is encouraged.
|Non Allowed Subjects:||None|
|Core Participation Requirements:||
For the purposes of considering request for Reasonable Adjustments under the Disability Standards for Education (Cwth 2005), and Student Support and Engagement Policy, academic requirements for this subject are articulated in the Subject Overview, Learning Outcomes, Assessment and Generic Skills sections of this entry.
It is University policy to take all reasonable steps to minimise the impact of disability upon academic study, and reasonable adjustments will be made to enhance a student's participation in the University's programs. Students who feel their disability may impact on meeting the requirements of this subject are encouraged to discuss this matter with a Faculty Student Adviser and Student Equity and Disability Support: http://services.unimelb.edu.au/disability
CoordinatorDr Richard Brak
Dr Richard Brak
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.
After completing this subject, students should
Up to 50 pages of written assignments (40%: two assignments worth 20% each, due mid and late in semester), a 3 hour written examination (60%, in the examination period).
|Prescribed Texts:|| |
"Analytic Combinatorics" by Philippe Flajolet and Robert Sedgewick, Cambridge University Press, 2009
|Recommended Texts:|| |
|Breadth Options:|| |
This subject is not available as a breadth subject.
|Fees Information:||Subject EFTSL, Level, Discipline & Census Date|
Upon completion of this subject, students should gain the following generic skills:
Master of Philosophy - Engineering |
Master of Science (Mathematics and Statistics)
Mathematics and Statistics |
Download PDF version.