Week | Lecture dates | Sections | topics |
---|---|---|---|
1 | 9/2 (Thurs) | ---— | Class cancelled due to flooding |
1 | 9/8 (Wed) | 1, 2.1-2.3 | Introduction, Permutations and Combinations |
2 | 9/9 (Thurs) | 2.4–2.6, 3.1 | r-permutations, r-combinations; probability; pigeonhole |
3 | 9/13, 16 (MTh) | Ch.5 | Binomial cofficients; posets |
4 | 9/20, 23 (MTh) | Ch.6 | Inclusion-exclusion principles |
5 | 9/27, 30 (MTh) | Ch.7 | Generating functions, recurrence relations |
6 | 10/4, 7 (MTh) | 8.1-8.2 | Catalan numbers, Difference sequences, Stirling numbers |
7 | 10/11, 14 (MTh) | Ch. 2, 5–8 | Review, MIDTERM EXAM |
8a | 10/18 (M) | 8.3–4 | Partition numbers |
9 | 10/21, 25 (ThM) | Ch. 11 | Paths and cycles in graphs, bipartite graphs, trees |
10 | 10/28, 11/1 (ThM) | Ch. 12 |
graph colorings, chromatic polynomials, planar graphs, clique numbers |
11 | 11/4, 11/8 (ThM) | Ch. 10 | Block designs, orthogonal block designs, Latin squares |
12 | 11/11, 15 (ThM) | Ch. 13 | Digraphs, Networks, Matching in bipartite graphs |
13 | 11/18, 11/22 (ThM) | Chapters 8, 10–13 | review, MIDTERM EXAM |
14 | 12/2, 6 (ThM) | Ch. 14 | Permutations, Burnside's theorem and Polya counting |
15 | 12/9 (Thurs) | 10.1 | Finite fields |
15 | 12/13 (Monday) | all sections | Review of entire semester |
FINAL EXAM |
Sec.2:12/16(Th) Sec.1: 12/20(M) | 8:00--11 AM | The final exam will be cumulative |
Syllabus in Catalogue: Existence and enumeration of designs and patterns such as codes, graphs, and block designs, and extremal problems related to such objects. Emphasis on applications to computer, biological, physical, and social problems.
Prerequisites: CALC2 and 01:640:250.
Course grade: 2 Midterms (20% each); Final Exam (40%); HW (15%); Quizzes (5%).
Self-Reporting Absence Website: Students are expected to attend all classes; if you expect to miss one or two classes, please use the University's absence reporting website to indicate the date and reason for your absence. An email is automatically sent to me.
Academic integrity policy: All students in the course are expected to be familiar with and abide by the academic integrity policy. Violations of the policy are taken very seriously.
Disabilities policy: Rutgers is fully committed to compliance with the Americans with Disabilities Act; see policies and procedures.
Charles Weibel / Fall 2021