Algebraic and Computational Combinatorics

Duration

October 1989 - December 1992.

Director

Peter Paule.

Sponsored by

Austrian Science Foundation.

Goals

Symbolic methods for the treatment of formulae (binomial identies, formal power series, q-hypergeometric functions, closed form solutions of difference equations, etc.) in the area of combinatorics are studied. Computer algebra implementations of known and new algorithms should serve as efficient tools for the mathematical and algorithmic research in this field.

Selected Publications

G.E. Andrews, P. Paule: Some questions concerning computer-generated proofs of double-sum identity; RISC-Linz report series no. 91-02.

P. Lisonek: The performance of Gosper's algorithm on rational function inputs; RISC-Linz report series no. 91-31.

P. Paule: Parallel algorithms in computer algebra: Zeilberger's holonomic systems approach; RISC-Linz report series no. 90-49.

Maintained by: The System Administration
Last Modification: March 7, 1997

[Up] [RISC-Linz] [University] [Search]