|
Lecturer(s)
|
-
Lachman Dominik, Mgr.
-
Švrček Jaroslav, RNDr. CSc.
|
|
Course content
|
1. Special matrices. 2. The Van der Warden problem, Burnside's lemma. 3. Geometrical methods in combinatorics. 4. Extremal geometrical constants 5. Matroids.
|
|
Learning activities and teaching methods
|
|
Lecture, Dialogic Lecture (Discussion, Dialog, Brainstorming)
|
|
Learning outcomes
|
Manage of using of combinatorial methods.
5. Synthesis Summarise all gained combinatorial experience in applications
|
|
Prerequisites
|
unspecified
KAG/DKOM7
|
|
Assessment methods and criteria
|
Oral exam
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). Exam: the student has to understand the subject and be able to prove the main results.
|
|
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.
-
Matoušek J., Nešetřil J. (2010). Kapitoly z diskrétní matematiky. Praha, Karolinum.
-
Meňšikov S., Revjakin A. M., Kopylova A. N. (1982). Kombinatornyj analiz. Nauka Moskva.
-
Rota G. C. (1978). Studies in Combinatorics. MAA Washington.
|