Welcome - Combinatorics: Techniques and Structures MATH 4370   Combinatorics: Techniques and Structures
CREDIT HOURS: 3
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. Advanced techniques include recurrence relations, generating functions and power series. Structures include partial orders, set systems and transversals, and finite geometries
FORMAT: Lecture
PREREQUISITES: MATH 2112.03 or MATH 2051.03 or MATH 3070.03 or MATH 3330.03
CROSS-LISTING: MATH 5370.03