On rational definite summation

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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)$.
LaTeX 2.09, 7 pages, submitted to "Programming & Computer Software"

Keywords

Symbolic Computation, Discrete Mathematics, I.1.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32261

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0407059
 http://arxiv.org/abs/cs/0407059

Collections

arXiv