product iamge

Minimal decomposition of hypergeom sums

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

We present an algorithm which, given a hypergeometric term T(n), constructs hypergeometric terms T1(n) and T2(n) such that T(n) = T1(n+1) - T1(n) + T2(n), and T2 is minimal in some sense. This solves the decomposition problem for indefinite sums of hypergeometric terms: T1(n+1) - T1(n) is the ''summable part'' and T2(n) the :non-summable part'' of T(n).

Author(s): Abramov, Petkovsek.

Language: English
Pages: 8