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

- News and General Information
- Contents

---> detailed contents (Vorlesungsinhalte) - Tutorial
- References

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

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:

- Basic Counting
- Generating Functions
- Combinatorics of Finite Sets
- Posets
- Duality Theorems
- Polya Theory
- Design Theory
- Graphs and Chromatic Number
- Gray Codes and De Brujin Sequences
- Catalan Families

- Tuesday, 10:15 - 11:45, MA 644, Linda Kleist (English)
- Tuesday, 12:15 - 13:45, MA 551, Linda Kleist (Deutsch)
- Thursday, 14:15 - 15:45, MA 644, Linda Kleist (Deutsch)

kleist(at)math.tu-berlin.de or room MA 609

- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf] Das Do-Tut ist eimalig verschoben auf 16:15Uhr in MA 644 (gleicher Raum).
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]
- Practice sheet [pdf]

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.

There will be oral exams in groups of three on july 21, 22 and october 1, 2.

- M.Aigner: A Course in Enumeration;

Springer, 2007. - R.Graham, D.Knuth, O.Patashnik: Concrete Mathematics;

Addison-Wesely, 1989. - S.Jukna: Extremal Combinatorics;

Springer, 2001. - R.Stanley: Enumerative Combinatorics, Volume I;

Cambridge Univ. Press, 1997. - R. Stanley: Enumerative Combinatorics, Volume II;

Cambridge Univ. Press, 1999. - J.H.van Lint and R.M.Wilson: A Course in Combinatorics (2nd ed.);

Cambridge Univ. Press, 2001.

Last modified March 2015