ENGLISH

Minimal decomposition of hypergeom sums

By Petkovsek. , Abramov

Book information

ISBN
1-58113-417-7
Language
english
Format
DJVU
Filesize
285 kB (291603 bytes)
Pages
8\8
Library
kolxoz
Time added
2009-07-20 03:45:11

Description

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).

Similar books