Symbolic Computation Group

David R. Cheriton School of Computer Science
University of Waterloo, Waterloo, Ontario, Canada

Automatic Proofs of Identities
Bruno Salvy, Projet ALGO, INRIA Rocquencourt, France
Friday, May 13, 2011 at 1:30pm, at U. of Waterloo


In the past 30 years, computer algebra has made a lot of progress in the design of algorithms operating on mathematical objects. In particular, a few simple but fruitful ideas make it possible to compute sums or integrals of a wide variety of functions. Early work concentrated on hypergeometric identities. This was generalized by Zeilberger to deal with what he called "holonomic" systems. Recently, we generalized this further in
a joint work with Chyzak and Kauers so that even more functions and sequences can be handled automatically. The talk will focus on the basic principles that underly all these algorithms.


Last modified on Sunday, 04 November 2012, at 15:42 hours.