0;115;0c
Enumerative Combinatorics is divided in two subfields: (i) Counting Theory and (ii) Formal Manipulation Techniques. This lecture is mainly devoted to Counting Theory; the other subfield is treated in the lecture Algorithmic Combinatorics.
In this lecture basic combinatorical sequences such as binomial coefficients, Stirling numbers, or partition numbers are introduced as well as the concept of group actions. The latter is a fundamental concept that connects algebra with combinatorics.
Literature:
Requirements: Basic knowledge from analysis and linear algebra.
The assignments for the exercises will be posted here.
Posted on | Exercise sheet |
03.10.2023 | exercises-01.pdf |
10.10.2023 | exercises-02.pdf |
24.10.2023 | exercises-03.pdf |
30.10.2023 | exercises-04.pdf |
07.11.2023 | exercises-05.pdf |
15.11.2023 | exercises-06.pdf |
28.11.2023 | exercises-07.pdf |
05.12.2023 | exercises-08.pdf |
12.12.2023 | exercises-09.pdf |
09.01.2024 | exercises-10.pdf |
30.01.2024 | exercises-12.pdf |
Find the exercises on the last two pages of the file exercises-12.pdf.
Silviu Radu