Peter Paule
Research Institute for Symbolic Computation
78 Papers
324 Citations
Peter Paule is an academic researcher from Research Institute for Symbolic Computation. The author has contributed to research in topics: Symbolic computation & Plane partition. The author has an hindex of 23, co-authored 73 publications. Previous affiliations of Peter Paule include Johannes Kepler University of Linz & University of Vienna.
Chat about Author
Papers
A Mathematica version of Zeilberger's algorithm for proving binomial coefficient identities
Peter Paule,Markus Schorn +1 more
TL;DR: Based on Gosper's algorithm for indefinite hypergeometric summation, Zeilberger's algorithms for proving binomial coefficient identities constitutes a recent breakthrough in symbolic computation.
254
Greatest factorial factorization and symbolic summation
TL;DR: The greatest factorial factorization of a polynomial provides an analogue to square-free factorization but with respect to integer shifts instead to multiplicities as well as to Gosper's algorithm for summing hypergeometric sequences.
141
MacMahon's Partition Analysis
TL;DR: The object of this paper is to show that partition analysis is ideally suited for being implemented in computer algebra and to this end the computer algebra package Omega is developed.
122
q -hypergeometric solutions of q -difference equations
TL;DR: Algorithm qHyper for finding all solutions y ( x) of a linear homogeneous q -difference equation, such that y ( qx )= r ( x ) y (x ) where r (x) is a rational function of x .
72