Lecturer: Dr. Mihyun Kang
Schedule
The lecture begins on: 19.04.2006.
| VL | Wednesday | 09:00 - 11:00 | (RUD 26, 1.307) |
|---|---|---|---|
| Friday | 09:00 - 11:00 | (RUD 26, 1.303) | |
| Office hour | Wednesday | 14:00 - 15:00 |
Classification
- Hauptstudium, Halbkurs
- Theoretische Informatik
Summary of the course
Generating functions are an important tool in enumerative combinatorics. This course is a gentle introduction to generating functions, illustrated by many examples and applications. It will deal with formal power series, analytic properties of functions represented as power series and several techniques to derive asymptotics of the coefficients of generating functions. The participants will learn how to use generating functions to enumerate combinatorial objects and derive the asymptotics.
Prerequisites
- Basic knowledge in analysis and discrete mathematics.
- The language of the course is English
References
- , Analytic Combinatorics, Version of April 2006
- , Generatingfunctionology, 2nd ed., Boston, Academic Press, 1994
