MATH 188Algebraic Combinatorics
A rigorous introduction to algebraic combinatorics. Basic enumeration and generating functions. Enumeration involving group actions: Polya theory. Posets and Sperner property. q-analogs and unimodality. Partitions and tableaux. Credit not offered for MATH 188 if MATH 184 or MATH 184A previously taken. If MATH 184 and MATH 188 are concurrently taken, credit only offered for MATH 188.
Prerequisites
From the catalog: “MATH 31CH or MATH 109 and MATH 18 or MATH 31AH and MATH 100A or 103A. Students who have not completed listed prerequisites may enroll with consent of instructor.”
Where it sits in degree plans
One of the options in (1)
- Artificial Intelligence
Courses that list MATH 188 as a prerequisite (9)
- CSE 100 Advanced Data Structures
- CSE 100R Advanced Data Structures
- CSE 101 Design and Analysis of Algorithms
- CSE 103 A Practical Introduction to Probability and Statistics
- CSE 105 Theory of Computability
- CSE 106 Discrete and Continuous Optimization
- CSE 107 Introduction to Modern Cryptography
- CSE 127 Introduction to Computer Security (4) Tags: Systems, Applications of Computing
- ECON 149 Introduction to Economic Design