On rational definite summation

Simple item page
dc.creatorTsarev, Sergey P.
dc.date2004-07-24
dc.date.accessioned2026-07-07T03:21:36Z
dc.date.available2026-07-07T03:21:36Z
dc.descriptionWe 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)$.
dc.descriptionLaTeX 2.09, 7 pages, submitted to "Programming & Computer Software"
dc.identifierhttps://arxiv.org/abs/cs/0407059
dc.identifierhttp://arxiv.org/abs/cs/0407059
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32261
dc.subjectSymbolic Computation
dc.subjectDiscrete Mathematics
dc.subjectI.1.2
dc.titleOn rational definite summation
dc.typetext

Files

Collections

arXiv