|
|
|
||
Last update: T_KAM (07.05.2001)
|
|
||
Last update: T_KAM (20.04.2008)
Students learn the fundamental technique of combinatorial enumeration, which are generating functions. |
|
||
Last update: doc. RNDr. Martin Klazar, Dr. (14.05.2020)
Oral exam, with written preparation. Exam question are/will be given on the course page, see teacher's web page. ************************************************************************ As to situation caused by the current coronavirus pandemia in spring and summer 2020. Form of exam (contact or distant) will be determined for each term in SIS according to actual situation. Contact exam will be writen one with possible oral part. For this course the contact form in small groups (<6, <11 people) appears probable. |
|
||
Last update: T_KAM (20.04.2008)
R.P. Stanley: Enumerative combinatorics I, Wandswort & Brooks, 1986.
R.P. Stanley: Enumerative combinatorics II, Cambridge University Press, 1999. |
|
||
Last update: doc. RNDr. Martin Klazar, Dr. (14.05.2020)
Oral exam, with written preparation. Exam question are/will be given on the course page, see teacher's web page. ************************************************************************ As to situation caused by the current coronavirus pandemia in spring and summer 2020. Form of exam (contact or distant) will be determined for each term in SIS according to actual situation. Contact exam will be writen one with possible oral part. For this course the contact form in small groups (<6, <11 people) appears probable. |
|
||
Last update: T_KAM (20.04.2008)
1. Problems of combinatorial enumeration. 2. Bijections. 3. Generating functions. 4. Exponential and composition formula. 5. Lagrange's inversion formula. 6. Asymptotic estimates. |