After successful completion of the course, students are able to specify combinatorial enumeration problems by utilizing combinatorial constructions and to solve them by means of generating functions, to solve combinatorial problems on partially ordered sets, and to solve simple problems in graph theory.
Generating functins and combinatorial enumeration problems, combinatorics for partial ordered sets, Pólya's enumeration formula, introduction to graph theoretic problems
Anmeldung via TISS bei Gruppen, nicht LVA-Anmeldung!
UE jeweils am Montag, 14-15, UE-Gruppe A: FH HS 4, UE-Gruppe B: Sem.R. DA grün 02B
UE1: 20.03.2023, UE2: 27.03.2023, UE3: 17.04.2023, UE4: 24.04.2023, UE5: 08.05.2023, UE6: 15.05.2023, UE7: 22.05.2023, UE8: 05.06.2023, UE9: 12.06.2023, UE10: 19.06.2023, UE11: 26.06.2023