Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
J. Symbolic Computation (1998) 11, 1--000 Multibasic and Mixed Hypergeometric
 

Summary: J. Symbolic Computation (1998) 11, 1--000
Multibasic and Mixed Hypergeometric
Gosper­Type Algorithms
ANDREJ BAUER y AND MARKO PETKOV Ÿ SEK z
y Department of Computer Science, Carnegie Mellon University, Pittsburgh PA, U.S.A.
z Department of Mathematics and Mechanics, University of Ljubljana, Slovenia
(Received 17 September 1997)
Gosper's summation algorithm finds a hypergeometric closed form of an indefinite sum
of hypergeometric terms, if such a closed form exists. We extend his algorithm to the
case when the terms are simultaneously hypergeometric and multibasic hypergeometric.
We also provide algorithms for finding polynomial as well as hypergeometric solutions
of recurrences in the mixed case. We do not require the bases to be transcendental, but
only that q
k 1
1
\Delta \Delta \Delta q
km
m 6= 1 unless k 1 = \Delta \Delta \Delta = km = 0. Finally, we generalize the concept
of greatest factorial factorization to the mixed hypergeometric case.
1. Introduction and notation

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

 

Collections: Mathematics