|
Lecturer(s)
|
-
Švrček Jaroslav, RNDr. CSc.
-
Lachman Dominik, Mgr.
|
|
Course content
|
1. Generating functions and their application. 2. Latin squares and Latin right prallelogramms, orthogonal Latin squares. 3. Block schemes. 4. Pólya-Redfield method. 5. The Ramsey theorem.
|
|
Learning activities and teaching methods
|
|
Lecture, Dialogic Lecture (Discussion, Dialog, Brainstorming)
|
|
Learning outcomes
|
Understand to base of combinatorics and their applications.
3. Aplication Show how to use combinatorial knowlegdes in relative parts of mathematics
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Didactic Test
Credit: the student has to solve 5 combinatorial problems (homework) assigned during the course and has to pass one written test (i.e. to obtain at least half of the possible points).
|
|
Recommended literature
|
-
Bosák J. (1976). Latinské čtverce. ŠMM Mladá fronta Praha.
-
Chen C. C., Koh K. M. (2004). Principles and Techiques in Combinatorics. World Scientific New Jersey.
-
Meňšikov S., Revjakin A. M., Kopylova A. N. (1982). Kombinatornyj analiz. Nauka Moskva.
-
Rota G. C. (1978). Studies in Combinatorics. MAA Washington.
|