|
|||||||||||||||||||||||||||||||||||||||||
Computational Combinatorics - MATH5505 | |||||||||||||||||||||||||||||||||||||||||
Description The pigeon-hole principle and Ramsey theory, the marriage theorem, the inclusion-exclusion principle and applications, counting sequences and generating functions, partially ordered sets and lattices, group actions and Polya counting.
Pre-requisites: 24 units of level III mathematics or a degree in a numerate discipline or permission of the Head of Department. Note: Course not offered every year - contact School for more information. Excluded: MATH3790 |