Course Title
Combinatorics
Course Type
CUGS CS Review / CUGS CS Core / CUGS CS Advanced / Other
Suggested # of Credits
5,0 points
Intended audience
CUGS doctoral students, ECSEL Students.
Prerequisites
Previous course in discrete mathematics, e.g., Discrete Structures II or similar.
Contents
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.
Organized by
Department of Mathematics, Linköping University
Organization
24,0 hours of lectures + seminars. Course is given in condensed form.
See course schedule.
Examination
Two parts: take-home assignments and oral presentation of a research paper at the very end of the course.
Literature
Richard P. Stanley, "Enumerative Combiantorics Vol 1"
Examiner
Prof. Svante Linusson
Course homepage
TBA
|
