The University of New South Wales

go to UNSW home page

Handbook Home

PRINT THIS PAGE
Computational Combinatorics - MATH5505
 The Red Centre promenade

   
   
   
 
Campus: Kensington Campus
 
 
Career: Postgraduate
 
 
Units of Credit: 6
 
 
EFTSL: 0.12500 (more info)
 
 
Indicative Contact Hours per Week: 3
 
 
CSS Contribution Charge:Band 5 (more info)
 
   
 
Further Information: See Class Timetable
 
  

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

URL for this page:

© The University of New South Wales (CRICOS Provider No.: 00098G), 2004-2011. The information contained in this Handbook is indicative only. While every effort is made to keep this information up-to-date, the University reserves the right to discontinue or vary arrangements, programs and courses at any time without notice and at its discretion. While the University will try to avoid or minimise any inconvenience, changes may also be made to programs, courses and staff after enrolment. The University may also set limits on the number of students in a course.