Algorithmic Combinatorics Seminar, Summer 2013

Time: Wednesday, 14:00 - 16:00

Place: Seminarraum Schloss Hagenberg

6.03. Peter Paule Organizational items
Prof. James Sellers Old and new results for generalized Frobenius partition functions abstract
13.03. Fredrik Johansson Fast, rigorous, arbitrary precision numerics with ball arithmetic
20.03. Manuel Kauers Ore polynomials in Sage
10.04. Matteo Gallet A glimpse on GKZ systems
17.04. Zafeirakis Zafeirakopoulos The simplest way to solve linear diophantine systems
24.04. Christoph Koutschan Computer algebra for knot theory
08.05. Veronika Pillwein Termination conditions for positivity proving procedures
15.05. Veronika Pillwein Termination conditions ctd and a problem of VHM
22.05. Silviu Radu An algorithmic approach to find the polynomial relation between two meromorphic functions on a compact Riemann surface
29.05. Manuel Kauers Greatest Factorial Factorization
05.06. Marc Mezzarobba Linear ODEs & Divergent Series
12.06. Paul Gschöpf Hypergeometric solutions of P-finite recurrences
19.06. Mark Round CUDA and GPU Programming: An introduction and some research
26.06. Jakob Ablinger Analytic vontinuation of generalized harmonic sums
Peter Paule Ramanujan's congruences modulo powers of 11 revisited
28.06. Prof. Bernd Sturmfels The convex hull of a space curvey abstract

Previous Years

The seminar program of previous years is available here