Mathematics (MATH) Courses>Combinatorial Mathematics

MATH422 - Combinatorial Mathematics

Description

Permutations and combinations, generating functions, recurrence relations, inclusion-exclusion principle. Mobius inversion, Polya's enumeration theorem. Ramsey's theorem, systems of distinctive representatives, combinatorial designs, algorithmic aspects of combinatorics.

Units

1.5

Hours: lecture-lab-tutorial

3-0-0

Prerequisites

  • Complete all of the following
    • Complete all of:
      • MATH212 - Introduction to Algebra (1.5)
      • MATH222 - Discrete and Combinatorial Mathematics (1.5)
    • 1.5 units of 300 or 400 level MATH course
  • or permission of department.

Course offered by

Department of Mathematics and Statistics

Course schedules

Summer timetable available: February 15. Fall and Spring timetables available: May 15.

Use the buttons below to search the timetable. If the search results show 0 classes and the message ‘Please search again’, then the class is not scheduled for the selected term.