Assistant Professor, Gr-I
Combinatorics is a fascinating but very broad subject. This makes it hard to classify. The blueprint of the course MATH F421 is the following: It starts with basic definitions and motivations by picking problems of perfect cover, Latin squares and magic squares/cube (SAIM algorithm). Then it will be covering advanced theory of permutations and combinations, counting principles, theory of partitions, special counting sequences, system of distinct representatives, combinatorial design and enumerations of graphs. For MATH F421, the Text Book: Richard A. Brualdi, Introductory Combinatorics, Pearson Education 5th Edition 2020.
This website uses cookies or similar technologies, to enhance your browsing experience.