CUGS CS Review / CUGS CS Core / CUGS CS Advanced / Other
Suggested # of Credits
CUGS doctoral students, ECSEL Students.
Previous course in discrete mathematics, e.g., Discrete Structures II or similar.
Enumeraive combinatorics including the twlevefold way, inclusion-exclusion and other sieve methods and the method of determinants.
Permutation statistics, patterns in permutations and q-calculus.
Partially orderes sets, lattices and the incidence algebra.
The Möbius function of a poset, the Möbius inversion formula and conections to topological combinatorics and hyperplan arrangements.
Student seminars on additional topics in combinatorics.
Department of Mathematics, Linköping University
24,0 hours of lectures + seminars. Course is given in condensed form.
See course schedule.
Two parts: take-home assignments and oral presentation of a research paper at the very end of the course.
Richard P. Stanley, "Enumerative Combiantorics Vol 1"
Prof. Svante Linusson