Notes on Enumerative Combinatorics and Partially Ordered Sets
Ryan R. Martin, Jephian C.-H. Lin, and Shanise Walker
***** come to class first *****Course website
Enumerative Combinatorics, Volume 1, second edition
Richard P. Stanley, Cambridge University Press, 2011
Combinatorics is a subject that studies various ways of counting and finite structures. In this course, we will revisit the counting skills in high school and provide a higher point of view, including the use of generating functions. This course will also introduce partially ordered sets (posets), which is an abstract structure that describes sets and the relations between them. Many theorems can be generalized to posets, including the principle of inclusion and exclusion, and the Möbius inversion.
(2% HW)*12 + (20% Midterm)*2 + 36% Final exam
Weekly homework. No quizzes. Starting from HW4, the homework should be type through LaTeX and submitted through CoCalc.
Students with diverse learning styles and needs are welcome in this course. In particular, if you have a disability/health consideration that may require accommodations, please feel free to approach me.
Percentage scores will be converted to letter grades according to the university-wide standard table
You are expected to attend the classes.
If you miss some course components due illness, accident, family affliction, or religious observances, please talk to me and provide the documentation. In such cases, the course component is excused, and your course score will be calculated by distributing the weight of the missed item(s) across the other course components. Missing components are limited to at most 20%.