Time: T-TH 12-1:20 PM
Location: LOCKETT 0130
Office Hours: TH 10:30-11:30 AM LOCKETT 346
Instructor: Avah Banerjee
Email: ibanerjee@lsu.edu
Course website: cct.lsu.edu/~ibanerjee/math4172.html
Prerequisites
Course description:
This is a introductory course in Combinatorics. We will cover some classical topics
such as , permutations and combinations, recurence relations, matching, Polya counting etc.
Textbook:
Introductory Combinatorics, Fifth Edition by Richard Brualdi (required)
Tentative List Topics:
1. Introduction: Examples
2. Mathematical Preliminaries
3. Pigeonhole Principle
4. Permutations and Combinations
5. Generating Functions
6. Inclusion Exclusion
7. Matching
8. Polya Enumeration
Grading (tentative):
1. Homework : 5 x 10%
2. Midterm : 25%
3. Final Exam : 25%