A new algorithm for the recursion of hypergeometric multisums with improved universal denominator

From MaRDI portal
Publication:3062298

zbMATH Open1207.33025arXiv0809.4696MaRDI QIDQ3062298FDOQ3062298


Authors: Stavros Garoufalidis, Xinyu Sun Edit this on Wikidata


Publication date: 3 January 2011

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 x(n) 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 ai(n),bi(n),c(n) are polynomials. Our algorithm improves Abramov's universal denominator.


Full work available at URL: https://arxiv.org/abs/0809.4696




Recommendations





Cited In (5)

Uses Software





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)