
Detailed information 
Original study plan 
Bachelor's programme Technical Mathematics 2017W 
Objectives 
The lecture can be viewed as an algorithmic supplement
to the classical book "Concrete Mathematics" by Graham,
Knuth, and Patashnik. Namely, it presents computer algebra
tools for dealing with four mathematical concepts which play
a fundamental role in many different areas of mathematics
and computer science: symbolic sums, recurrence (difference)
equations, generating functions, and asymptotic estimates.
Their key features, in isolation or in combination, their
mastery by paper and pencil or by computer programs, and
their applications, also to "real world problems" like
e.g. the analysis of algorithms, are studied.

Subject 
Manipulation of formal power series, polynomials, cfinite sequences, hypergeometric series, holonomic sequences and series, and symbolic sums;
application of the toolbox to concrete examples in computer science and combinatorics.

Criteria for evaluation 
oral exam

Methods 
symbolic computation and in particular computer algebra, basic linear algebra, asymptotics

Language 
English 
Study material 
"The Concrete Tetrahedron" (Springer) by
Manuel Kauers and Peter Paule

Changing subject? 
No 
Corresponding lecture 
^{(*)}TM1WHVOANKO: VO Analytische Kombinatorik (3 ECTS)

