Inhalt

[ 201ZATAFICV24 ] VL Finite combinatorics

Versionsauswahl
Workload Education level Study areas Responsible person Hours per week Coordinating university
3 ECTS B3 - Bachelor's programme 3. year Mathematics Friedrich Pillichshammer 2 hpw Johannes Kepler University Linz
Detailed information
Original study plan Bachelor's programme Technical Mathematics 2025W
Learning Outcomes
Competences
The students are familiar with the basic principles of elementary combinatorics and beyond. This includes the analytical approach using generating functions and algebraic counting methods such as Polya's theorem. The students know the relevant proofs and can use the methods to solve more demanding tasks.
Skills Knowledge
  • know the basic principles of combinatorics and can use them to solve even complex, elementary counting tasks
  • can look at counting tasks from different perspectives and recognize equivalent problems and thus find solutions
  • can employ generating functions to solve simple and more demanding tasks
  • can solve recursions using generating functions and make asymptotic statements
  • know important results from the theory of partitions of integers
  • know the problem and Polya's counting theorem and its fundamentals in group theory
  • know how to prove Polya’s counting theorem and to be able to apply it to concrete problems
Basic principles of combinatorics, variations and combinations, sieve formula, generating functions, partitions of sets, partitions of natural numbers, solving recursions with generating functions, counting theorem of Polya, counting graphs
Criteria for evaluation Oral examination abound the content of the lecture
Methods Lecture using a manuscript
Language English and French
Study material Manuscript by Prof. Pillichshammer (https://docplayer.org/41887927-Endliche-kombinatorik.html)

Changing subject? No
Earlier variants They also cover the requirements of the curriculum (from - to)
201ZAHLEKOV20: VL Finite combinatorics (2020W-2024S)
On-site course
Maximum number of participants -
Assignment procedure Direct assignment