MATH429-12S1 (C) Semester One 2012

Combinatorics

15 points

Details:
Start Date: Monday, 20 February 2012
End Date: Sunday, 24 June 2012
Withdrawal Dates
Last Day to withdraw from this course:
  • Without financial penalty (full fee refund): Friday, 2 March 2012
  • Without academic penalty (including no fee refund): Friday, 18 May 2012

Description

Combinatorics

Matroids (also called combinatorial geometries) are precisely the structures that underlie the solution of many combinatorial optimization problems.  These problems include scheduling and timetabling, and finding the minimum cost of a communications network between cities. Given this, it is perhaps surprising that matroid theory unifies the notions of linear independence in linear algebra and forests in graph theory as well as the notions of duality for graphs and codes.

This self-contained course is an introduction to matroid theory, a branch of discrete mathematics that has basic connections with graphs, codes, projective geometries, and combinatorial optimisation. The course is intended for students majoring in Mathematics or Computer Science.

Prerequisites

Subject to approval of the Head of School.

Course Coordinator

Charles Semple

Indicative Fees

Domestic fee $788.00

* All fees are inclusive of NZ GST or any equivalent overseas tax, and do not include any programme level discount or additional course-related expenses.

For further information see Mathematics and Statistics .

All MATH429 Occurrences