MTH 3527 - Combinatorics I (Enumeration)

Fall 2002

Course Information

Course:	MTH 3527, Combinatorics I (Enumeration)
Instructor:	Professor Andrei Zelevinsky
Time and Place:	MW 5:15 - 6:45 PM, in 544 NI
Textbook:	R. Brualdi, Introductory Combinatorics, Fourth Edition. Prentice Hall, 1999

Course Description

The course discusses basic topics in Enumerative Combinatorics. We discuss such combinatorial objects as finite sets and multisets, various classes of maps between them, partitions, and lattice paths. Enumerating these objects involves fundamental sequences of numbers: binomial coefficients, Stirling numbers of the first and second kind, Catalan numbers, Eulerian numbers, etc. We also discuss basic methods of enumeration: basic counting rules, ordinary and exponential generating functions, finite differences, linear recursions, inclusion-exclusion principle, Polya's theory.

The grade will be based on class participation and homework assignments.

Department of Mathematics

Northeastern University
Boston, MA, 02115
Office: 431 LA
Phone: (617) 373-5648
Email: andrei@neu.edu

Back to my home page.

Created: September 17, 2002. Last modified: September 24, 2002.