English

On rational definite summation

Symbolic Computation 2007-05-23 v1 Discrete Mathematics

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)=k=0n1R(k,n) S(n) = \sum_{k=0}^{n-1}R(k,n).

Keywords

Cite

@article{arxiv.cs/0407059,
  title  = {On rational definite summation},
  author = {Sergey P. Tsarev},
  journal= {arXiv preprint arXiv:cs/0407059},
  year   = {2007}
}

Comments

LaTeX 2.09, 7 pages, submitted to "Programming & Computer Software"