CombinatoricsFDA151, 2003VT
|
|
Course plan
Lectures
24h + seminars
Recommended for
CUGS doctoral students, ECSEL students.
The course was last given
New course
Goals
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 ordered sets, lattices and the incidence algebra.
- The Möbius function of a poset, the Möbius inversion formula and
connections to topological combinatorics and
hyperplan arrangements.
- Student seminars on additional topics in combinatorics.
Organization
24,0 hours of lectures + seminars. Course is given in condensed form.
Literature
Richard P. Stanley, "Enumerative Combiantorics Vol 1"
Lecturers
Prof. Svante Linusson, MAI
Examiner
Prof. Svante Linusson, MAI
Examination
Two parts: take-home assignments and oral presentation of a research paper at the very end of the course.
Credits
5 credits
Organized by
Department of Mathematics, Linköping University
Comments
Page responsible: Director of Graduate Studies