Course Contents
Combinatorics, generating functions, solving recursions, partially ordered sets, lattices, triangulations of convex polygons, planar graphs, Polya theory, designs
Literature
M. Aigner, Diskrete Mathematik, 5. Auflage, Vieweg, 2003.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Second edition, Addison-Wesley, Reading, MA, 1994.
W. Koepf, Hypergeometric Summation. An Algorithmic Approach to Summation and Special Function Identities, AMS, 1998.
J. Matoušek, J. Nešetril, Diskrete Mathematik. Eine Entdeckungsreise, Springer, 2002.
R.P. Stanley, Enumerative Combinatorics, Volume I, Cambridge 1997.
J.H. van Lint, R.M. Wilson: A Course in Combinatorics, Cambridge University Press, 2009.
Preconditions
recommended: Algorithmic Discrete Mathematics
- Lecturer: Annika Jäger
- Lecturer: Marc Pfetsch