Algorithmic Combinatorics Seminar, Summer 2011

Time: Wednesday, 14:00 - 16:00

Place: Seminarraum Schloss Hagenberg

9.03. Manuel Kauers Organizational items
Shaoshi Chen When does Almkvist-Zeilberger's algorithms succeed? abstract
16.03. Manuel Kauers Funny Walks
23.03. Christoph Koutschan Lattice Green's Functions
30.03. Dimitris E. Simos Efficient Algorithms for Compatible Sequences, Complexity Analysis and Related Problems
06.04. Yongjae Cha Closed Form Solutions for Difference Equations
13.04 Ionela Moale Explicit Min-Max Polynomials in Several Variables
11.05. Clemens Raab Integration of non-Liouvillian Functions
18.05. Maximilian Jaroschek Subresultants
25.05. Ainhoa Aparicio-Monforte Introduction to Differential Galois Theory (Part I)
01.06. Ainhoa Aparicio-Monforte Introduction to Differential Galois Theory (Part 2)
Zafeirakis Zafeirakopoulos Linear Diophantine Systems and Polyhedral Geometry
08.06. Jakob Ablinger (Cyclotomic, Generalized) Harmonic Sums and (Cyclotomic, Generalized) Harmonic Polylogarithms)
15.06. Thotsaporn Thanatipandonda (Aek) Evaluating a Determinant
22.06. Silviu Radu Modular Functions amd Congruences
29.06. Xiaoli Wu Generalized Newton iteration and application of involution in polynomial optimizations abstract
29.08. Prof. Richard Askey Inequalities for special trigonometric series abstract
30.08. Prof. Richard Askey Srinivasa Ramanujan, a little of what he did and why we care abstract

Previous Years

The seminar program of previous years is available here