[ 201SYMRCACV12 ] VL Computer Algebra for Concrete Mathematics

(*) Unfortunately this information is not available in english.
Workload Education level Study areas Responsible person Hours per week Coordinating university
3 ECTS B3 - Bachelor's programme 3. year Mathematics Carsten Schneider 2 hpw Johannes Kepler University Linz
Detailed information
Original study plan Bachelor's programme Technical Mathematics 2019W
Objectives In this lecture basic skills and techniques will be elaborated which are relevant to simplify formulas related to enumeration, in particular, to carry out the average and worst case complexity analysis of algorithms.
Subject The content of the lecture can be summarized by the following key words:

    algorithmic treatment of formal power series
    c-finite and holonomic functions/sequences
    recurrence solving
    basic aspects of asymptotics
    symbolic summation 

A major emphasis of the lecture is to present the basic notions, to develop the basic ideas of the underlying algorithms and to put computer algebra into action for concrete examples.

Criteria for evaluation oral exam
Methods symbolic computation and in particular computer algebra, basic linear algebra, asymptotics
Language English
Study material Many of the topics discussed in the lecture can be found in the book "Concrete Mathematics - A Foundation for Computer Science" by R.L.Graham, D.E.Knuth und O.Patashnik (Addison-Wesley, 1994) and "The Concrete Tetrahedron" by Manuel Kauers and Peter Paule (Springer Wien, 2011).
Changing subject? No
Corresponding lecture (*)TM1WHVOANKO: VO Analytische Kombinatorik (3 ECTS)
On-site course
Maximum number of participants -
Assignment procedure Direct assignment