A new algorithm for the recursion of hypergeometric multisums with improved universal denominator
From MaRDI portal
Publication:3062298
Abstract: The purpose of the paper is to introduce two new algorithms. The first one computes a linear recursion for proper hypergeometric multisums, by treating one summation variable at a time, and provides rational certificates along the way. A key part in the search of a linear recursion is an improved universal denominator algorithm that constructs all rational solutions of the equation frac{a_m(n)}{b_m(n)}x(n+m)+...+frac{a_0(n)}{b_0(n)}x(n)= c(n), where are polynomials. Our algorithm improves Abramov's universal denominator.
Recommendations
Cited in
(5)
This page was built for publication: A new algorithm for the recursion of hypergeometric multisums with improved universal denominator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3062298)