Course No
M203
Credit
4
Syllabus
Pigeonhole principle, Counting principles, Binomial coefficients, Principles of inclusion and exclusion, recurrence relations, generating functions, Catalan numbers, Stirling numbers, Partition numbers, Schr ̈oder numbers, Block designs, Latin squares, Partially ordered sets, Lattices, Boolean algebra.
Text Books
- R. A. Brualdi, “Introductory Combinatorics”, Pearson Prentice Hall, 2010.
- J. P. Tremblay, R. Manohar, “Discrete Mathematical Structures with Application to Computer Science”, Tata McGraw-Hill Edition, 2008.
Reference Books
- J. H. van Lint, R. M. Wilson, “A Course in Combinatorics”, Cambridge University Press, 2001.
- I. Anderson, “A First Course in Discrete Mathematics”, Springer Undergraduate Mathematics Series, 2001.
- R. P. Stanley, “Enumerative Combinatorics Vol. 1”, Cambridge Studies in Advanced Mathematics, 49, Cambridge University Press, 2012.