On rational definite summation
Abstract
We present a partial proof of van Hoeij-Abramov conjecture about the algorithmic possibility of computation of finite sums of rational functions. The theoretical results proved in this paper provide an algorithm for computation of a large class of sums $ S(n) = \sum_{k=0}^{n-1}R(k,n)$.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2004
- DOI:
- arXiv:
- arXiv:cs/0407059
- Bibcode:
- 2004cs........7059T
- Keywords:
-
- Symbolic Computation;
- Discrete Mathematics;
- I.1.2
- E-Print:
- LaTeX 2.09, 7 pages, submitted to "Programming &