On rational definite summation
Tsarev, Sergey P.
Original · EN
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) = ∑ₖ₌₀ⁿ⁻¹R(k,n).
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.