|
Lecturer(s)
|
|
|
|
Course content
|
1. Basic counting principles 2. Recurrence relations in combinatorial problems 3. Arrangements, permutations, and combinations 4. Fundamentals of probability 5. Combinatorial identities and their interpretations 6. Permutations, symmetry, and parity 7. The pigeonhole principle 8. The inclusion-exclusion principle 9. Set partitions: Stirling numbers of the second kind and Bell numbers
|
|
Learning activities and teaching methods
|
|
Lecture, Dialogic Lecture (Discussion, Dialog, Brainstorming)
|
|
Learning outcomes
|
Understanding to base of combinatorial principles.
1. Knowledge Describe basic principles and methods of combinatorics
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Seminar Work
Course credit requirements: Submit solutions to homework assignments set throughout the semester and pass two written tests (one halfway through the semester and one at the end).
|
|
Recommended literature
|
-
Herman J., Kučera R., Šimša J. (1997). Metody řešení matematických úloh II. Brno.
-
Chen C. C., Koh K. M. (2004). Principles and Techiques in Combinatorics. World Scientific New Jersey.
-
Markus A. (1988). Combinatorics (a Problem Oriented Approach). MAA Washington.
-
Mladenovič P. (1992). Kombinatorika. Beograd.
-
Riordan J. (1968). Combinatorial Identities. New York.
-
Švrček J. (2003). Úvod do kombinatoriky. VUP OLomouc.
|