Abstract
A partial proof of the van Hoeij-Abramov conjecture on the algorithm of definite rational summation is given. The results obtained underlie an algorithm for finding a wide class of sums of the form \(\sum\limits_{k = 0}^{n - 1} {R\left( {k,n} \right)} \).
Similar content being viewed by others
REFERENCES
Abramov, S.A., On the Summation of Rational Functions, Zh. Vychisl. Mat. Mat. Fiz., 1971, vol. 11, no.4, pp. 1071–1075.
Abramov, S.A., Applicability of Zelberger’s Algorithm to Hypergeometric Terms, Proc. Int. Symp. on Symbolic and Algebraic Computation, New York: ACM, 2002, pp. 1–7.
Abramov, S.A. and Le, H.Q., Applicability of Zeilberger’s Algorithm to Rational Functions, Proc. FPSAC’2000, Lect. Notes, Comput. Sci., Springer, 2000, pp. 91–102.
Petkovšek, M. and Zeilberger, D., A = B, Wellesley, Mass.: A.K. Peters, 1997.
Gosper, R.W., Jr., Decision Procedure for Indefinite Hypergeometric Summation, Proc. National Acad. Sci. USA, 1977, vol. 75, pp. 40–42.
van Hoeij, M.A., A Conjecture in the Problem of Rational Definite Summation, http: //arxiv.org/abs/math.CO/0210158, 2002.
Handbook of Mathematical Functions, Abramowitz, M. and Stegun, I.A., Eds., National Bureau of Standards, 1964.
Bateman, H. and Erdelyi, A., Higher Transcendental Functions, New York: McGraw-Hill, 1953, vol. 1.
Boas, R.P., Invitation to Complex Analysis, New York: Random House, 1987.
Abramov, S.A. and Bronstein, M., Hypergeometric Dispersion and the Orbit Problem, Proc. Int. Symp. on Symbolic and Algebraic Computation, St. Andrews, New York: ACM, 2002, pp. 8–13.
Author information
Authors and Affiliations
Additional information
Translated from Programmirovanie, Vol. 31, No. 2, 2005.
Original Russian Text Copyright © 2005 by Tsarev.
Rights and permissions
About this article
Cite this article
Tsarev, S.P. On the rational summation problem. Program Comput Soft 31, 56–59 (2005). https://doi.org/10.1007/s11086-005-0013-9
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11086-005-0013-9