Wednesday, June 14

(Semi)Automatic Manipulation of Binomial and Hypergeometric Sums and Series

3:30 pm - 6:00 pm
Room: Section A

Workers in discrete mathematics, especially in enumerative and algebraic combinatorics, know that every once in a while they will run across a "combinatorial sum," that is to say, a binomial or hypergeometric summation. The treatment of such series (which formerly meant tedious manipulations and application of hypergeometric summations and transformations, known only to experts) was revolutionized around 1990 by the development of algorithms which allow to automatically prove binomial and hypergeometric identities.The speakers in this minisymposium will focus on demonstrating what can and cannot be done today, and on presenting some of the recent ideas to overcome the performance problems, due to restricted memory and space of today's computers, which are encountered when trying to apply these algorithms to multiple summations.

Organizer: Christian Krattenthaler
Universität Wien, Austria
3:30 - 3:55 Some Thoughts on Computer Algebra and Combinatorics
George E. Andrews, Pennsylvania State University, USA
4:00 - 4:25 Symbolic Summation - Recent Progress
Peter Paule, Johannes Kepler Universität, Austria
4:30 - 4:55 Symbolic Summation in Difference Fields
Carsten Schneider, Johannes Kepler Universität, Austria
5:00 - 5:25 Symbolic Summation and Integration of Special Functions and Combinatorial Sequences
Frédéric Chyzak, INRIA Rocquencourt, France

©2000 Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 3/16/00; Updated 3/16/00