Combinatorics: Techniques and Structures

3 credits · Undergraduate

We introduce counting techniques and combinatorial structures, and show their application and use in all branches of mathematics. Counting techniques include combinations and permutations, the pigeonhole principle, inclusion/exclusion. Other topics include recurrence relations, generating functions and power series. Structures include partial orders, set systems and transversals, and simplicial complexes PREREQUISITES: MATH 2110.03 or MATH 2113.03 RESTRICTIONS: E1 EXCLUSIONS: MATH 4370.03 FORMATS: Lecture