| Course: | MTH 3527, Combinatorics I (Enumeration) |
| Instructor: | Professor Andrei Zelevinsky |
| Time and Place: | T. & Th. at 7:15 - 8:45 PM, in 544 NI |
| Textbook: | R. Brualdi, Introductory Combinatorics, Second Edition. Prentice Hall, 1992 |
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.
Created: September 21, 1998. Last modified: January 3, 1999.