Schedule
| VL |
Wednesday |
11:00 - 13:00 |
(RUD 26, 1.307) |
| Friday |
11:00 - 13:00 |
(RUD 26, 1.307) |
| Office hour |
Tuesday |
14:00 - 15:00 |
|
Classification
- Hauptstudium, Halbkurs
- Theoretische Informatik
Summary of the course
This course is an introduction to combinatorics, illustrated by many
examples and applications. It covers basic ideas of combinatorics,
counting problems and non-enumerative combinatorial problems. It
includes algebraic enumeration methods and asymptotic enumeration
methods, which deal with bijections, recurrences, generating functions
and several techniques to derive asymptotics.
Prerequisites
- Basic knowledge in discrete mathematics.
- The language of the course is English
References
- P. Cameron, Combinatorics: topics, techniques, algorithms, Cambridge University Press, 1994
- P. Flajolet and R. Sedgewick, Analytic Combinatorics, Version of November 23, 2004
- H. Wilf, Generatingfunctionology, 2nd ed., Boston, Academic Press, 1994
English