Rational solutions of linear differential and difference equations with polynomial coefficients
USSR Computational Mathematics and Mathematical Physics
Hypergeometric solutions of linear recurrences with polynomial coefficients
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Indefinite sums of rational functions
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Greatest factorial factorization and symbolic summation
Journal of Symbolic Computation
Rational summation and Gosper-Petkovsˇek
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Minimal decomposition of indefinite hypergeometric sums
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Rational canonical forms and efficient representations of hypergeometric terms
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Differential rational normal forms and a reduction algorithm for hyperexponential func
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Computation with hyperexponential functions
ACM SIGSAM Bulletin
A telescoping method for double summations
Journal of Computational and Applied Mathematics
Dimensions of solution spaces of H-systems
Journal of Symbolic Computation
Applicability of the q-analogue of Zeilberger's algorithm
Journal of Symbolic Computation
Polynomial ring automorphisms, rational (w,σ)-canonical forms, and the assignment problem
Journal of Symbolic Computation
Abstracts of conferences in honor of Doron Zeilberger's 60th birthday
ACM Communications in Computer Algebra
Hi-index | 0.00 |
We describe a multiplicative normal form for rational functions which exhibits the shift structure of the factors, and investigate its properties. On the basis of this form we propose an algorithm which, given a rational function R, extracts a rational part F from the product of consecutive values of R: Πk=n0n-1 R(k) =F(n)Πk=n0n-1 V(k) where the numerator and denominator of the rational function V have minimal possible degrees. This gives a minimal multiplicative representation of the hypergeometric term Πk=n0n-1 R(k). We also present an algorithm which, given a hypergeometric term T(n), constructs hypergeometric terms T1(n) and T2(n) such that T(n) = ΔT1(n) + T2(n) and T2(n) is minimal in some sense. This solves the additive decomposition problem for indefinite sums of hypergeometric terms: ΔT1(n) is the "summable part", and T2(n) the "nonsummable part" of T(n). In other words, we get a minimal additive decomposition of the hypergeometric term T(n).