Combinatorics BMS basic Course -- Diskrete Strukturen I Summer Term 2013 Sommersemester 2013 Prof. Stefan Felsner Sprechstunde n.V. LV-Nr.: 0230 L 149 Mo 8-10, MA 144 Mo 12-14, MA 144

## News:

Additional dates for oral exams are October 16 and 23.

Oral exams will be offered July 4., September 3. and October 1. additional dates will be offered if necessary and certainly in the winter-semester.
The assignment of candidates to slots is handled by Linda.

This is a Berlin Mathematical School (BMS) Basic Course, and will thus be taught in English.

This is also the first course of the course series
Diskrete Strukturen. It will be continued by Graphentheorie (Diskrete Strukturen II), Winter term 13/14.

## Contents:

Combinatorics is a branch of pure mathematics concerning the study of mostly finite objects. It is related to many other areas of mathematics, such as algebra, probability theory and geometry, as well as to applied subjects in computer science and statistical physics. Typical combinatorial questions are: Does a set with certain properties exist at all? If yes, how many are there? How do I find them? Combinatorics abounds with beautiful problems that are easily understood, but very often a real challenge to solve.

Combinatorics is as much about problem solving as theory building, though it has developed powerful theoretical methods, especially since the later twentieth century. The goal of this course will be to provide you with a broad overview – and with a firm, concrete “working knowledge” on basic combinatorial principles, tools, methods, theories, and results.

The course will cover most of the following topics:
1. Basic Counting
2. Generating Functions
3. Combinatorics of Finite Sets
4. Posets
5. Duality Theorems
6. Polya Theory
7. Design Theory
8. Graphs and Chromatic Number
9. Gray Codes and De Brujin Sequences
10. Catalan Families

## Tutorials:

• Tuesday, 12:15 - 13:45, MA 645, Linda Kleist (Deutsch)
• Wednesday, 14:15 - 15:45, EN 189, Linda Kleist (English)
• Wednesday, 16:15 - 17:45, MA 144, Udo Hoffmann (Deutsch)
kleist(at)math.tu-berlin.de or room MA 609
uhoffman(at)math.tu-berlin.de or room MA 606

### Problem sets

1. Practice sheet [ps] [pdf]
2. Practice sheet [pdf]
3. Practice sheet [pdf] Note that (2c) is corrected.
4. Practice sheet [pdf]
5. Practice sheet [pdf]
6. Practice sheet [pdf]
7. Practice sheet [pdf] There is a small correction of (4b).
8. Practice sheet [pdf]
9. Practice sheet [pdf]
10. Practice sheet [pdf]
11. Practice sheet [pdf]
12. Practice sheet [pdf]

### Terms to receive a certificate / credit-points:

At the beginning of every tutorial every participant has to mark in a list, which exercises of the current sheet she/he solved and is able to present. If somebody marks an exercise she/he is not able to present in a satisfying way, ALL exercises of this sheet will be disregarded and therefore not counted (also, each exercise is only counted once, even if presented in both tutorials). We expect a better presentation and solutions of master- and BMS students, compared to the ones, acceptable from bachelor students. Besides the exercises to present, there are exercises which has to be handed in in written form. This exercise will be corrected as usual. To recieve a certificate for the tutorials (Schein), you have to solve at least 50% of the exercises including the written exercises.
To complete the modul participants have to pass an additional oral exam.
The following dates are planned for the oral exams: 04.07., 03.09., 01.10., 16.10., 23.10.. You can register for an oral exams by contacting Linda Kleist (after having fulfilled all criteria).

## References:

• M.Aigner: A Course in Enumeration;
Springer, 2007.
• R.Graham, D.Knuth, O.Patashnik: Concrete Mathematics;