Discrete Mathematics

08 Aug -- 07 Dec 2025

Class Timings: Tuesday (11:30 to 13:00) and Friday (11:30 to 13:00)

Tentative Schedule

• Lecture 1: Introduction -- An Overview; Recurrences (Domain and Range Transformation). Notes.
• Lecture 2-4: Finite Calculus, Euler-McLaurin Formula. Notes.
• Lecture 5-8: Generating Functions. Notes.
• Lecture 9-11: The Principle of Inclusion and Exclusion (PIE), Derangements, Eulers phi function. Notes
• Lecture 12-14: Mobius inversion on posets. Notes

References

Books

• Peter Cameron: Combinatorics -- Topics, Techniques, Algorithms.
• J. Matousek and J. Nesetril: Invitation to Discrete Mathematics.
• J.H. van Lint and R.M. Wilson: Combinatorics.
• H. Wilf: Generatingfunctionology.
• M. Aigner and G.M. Ziegler: Proofs from THE BOOK.
• J. Matousek: Lectures in Discrete Geometry.
• Stanley: Enumerative combinatorics, both volumes.
• Flajolet, Sdgewick: Analytic Combinatorics.
• Spencer: Asymptopia.

Homework