|
Lecturer(s)
|
|
|
|
Course content
|
1. Special properties of permutations, graphs and degrees of permutations, applications. 2. The reccurence method in combinatorics, solving linear reccurence. 3. Generating functions. 4. Introduction to the combinatorial geometry. Polyominoes. 5. Combinatorics of convex polygons, the Cayley theorem. 6. Reccursive methods in combinatorial geometry.
|
|
Learning activities and teaching methods
|
|
Lecture, Dialogic Lecture (Discussion, Dialog, Brainstorming)
|
|
Learning outcomes
|
1. Special properties of permutations, graphs and degrees of permutations, applications. 2. The reccurence method in combinatorics, solving linear reccurence. 3. Generating functions. 4. Introduction to the combinatorial geometry. Polyominoes. 5. Combinatorics of convex polygons, the Cayley theorem. 6. Reccursive methods in combinatorial geometry.
3. Aplication Apply knowledges of basic combinatorial methods and principles.
|
|
Prerequisites
|
unspecified
KAG/MUKO3
|
|
Assessment methods and criteria
|
Oral exam, Seminar Work
Credit: the student has to solve 10 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 principal results.
|
|
Recommended literature
|
-
Golomb S. W. (1994). Polyminoes (Puzzles, Patterns, Problems and Packing). Princetown University Press New Jersey.
-
HADWIGER H., Debrunner H. (1966). Combinatorial Geometry in the Plane. Nauka Moskva.
-
Herman J., Kučera R., Šimša J. (1997). Metody řešení matematických úloh II. MU Brno.
-
Markus A. (1988). Combinatorics (a Problem Oriented Approach). MAA Washington.
-
Švrček J. (2003). Úvod do kombinatoriky. VUP OLomouc.
|