| Detailed information |
| Original study plan |
Master's programme Computer Mathematics 2018W |
| Objectives |
Fundamental methods of Enumerative Combinatorics with special emphasis on algorithmic methods.
|
| Subject |
Algebraic concepts such as formal power series, linear differential equations and differential equations with polynomial coefficients, etc. belong to the tools of enumerative combinatorics. These concepts are studied with the help of computer algebra methods; corresponding algorithmic implementations are used for practical problem solving
|
| Criteria for evaluation |
Depending on the number of participants: oral or written examination at the end of the semester
|
| Methods |
Board lecture; distribution of "homeworks", which are dealt with in the exercises.
|
| Language |
English and French |
| Study material |
Textbooks like e.g: The Concrete Tetrahedron (Paule, Kauers; Springer) or Enumerative Combinatorics (Stanley).
|
| Changing subject? |
No |
| Further information |
The lecture is held in English if at least one of the participants requests this.
|
| Corresponding lecture |
(*)TMCPAVOAKOM: VO Algorithmische Kombinatorik (3 ECTS)
|
