WEEK |
DATES |
LECTURES |
SECTIONS |
TUTORIALS |
1 |
Jan. 9-13 |
Pigeonhole and addition principle. Counting sets of pairs. Euler's function. | 6.2, 6.4; 10.1 - 10.3 |
No tutorial. |
2 |
Jan. 16-20 |
Functions, words and selections. Ordered selections without repetitions. Permutations. |
10.4 - 10.6 |
Chapter 6 |
3 |
Jan. 23-27 |
Binomial numbers. Unordered selections with repetitions. Binomial thm. Sieve principle. |
11.1 - 11.4 |
Chapter 10. |
4 |
Jan. 30 - Feb. 3 |
Partitions of sets and positive numbers. Multinomial numbers. |
12.1 - 12.4 |
Chapter 11. |
5 |
Feb. 6-10 |
Power series and algebraic properties. Partial fractions. |
25.1 - 25.2 |
Chapter 12 and review for test #1. |
6 |
Feb. 13-17 |
Binom thm w/negative exponents. Generating functions. |
25.3 - 25.4 |
Test #1 (Chapters 6, 10, 11 and 12). |
7 |
Feb. 20-24 |
Reading Week |
~ |
~ |
8 |
Feb. 27 - Mar. 2 |
Linear recurrences. Nonhomogeneous linear recurrences. Partitions and diagrams. Conjugate partitions. |
25.5 - 25.6; 26.1 - 26.2 |
Chapter 25 and solutions of test #1. |
9 |
Mar. 5-9 |
Partitions and generating funcs. Restricted partitions. |
26.3 |
Chapter 26. |
10 |
Mar. 12-16 |
Graphs and their representation. Isomorphisms. Valency. Paths and cycles. |
26.4; 15.1 |
Chapter 15 and review for test #2. |
11 |
Mar. 19-23 |
Trees. Vertex colouring. Planar graphs. Euler's theorem. |
15.2 - 15.6 |
Test #2 (Chapters 25, 26 and 15). |
12 |
Mar. 26-30 |
Words, codes and errors. Linear codes. Construction of linear codes. |
class notes; 24.1 - 24.2 |
Chapters 15 and 24, and solutions of test #2. |
13 |
Apr 5-9 |
Designs, t-designs. Course revision. |
24.3; 11.6 - 11.7 |
Chapter 11. |
All sections are from the textbook (Discrete Mathematics, 2nd edition by Norman L. Biggs). Class notes are required for planar graphs.