Course Description
The subject of enumerative combinatorics deals with counting the number of elements of a finite set. For instance, the number of ways to write a positive integer n as a sum of positive integers, taking order into account, is 2{{< sup “n1” >}}. We will be concerned primarily with bijective proofs, i.e., showing that two sets have the same number of elements by exhibiting a bijection (onetoone correspondence) between them. This is a subject which requires little mathematical background to reach the frontiers of current research. Students will therefore have the opportunity to do original research. It might be necessary to limit enrollment.
Instructor:  
Course Number: 

Departments:  
Topics:  
As Taught In:  Spring 2003 
Level: 
Undergraduate

Learning Resource Types
assignment
Problem Sets