Decision procedure for indefinite hypergeometric summation.
نویسنده
چکیده
Given a summand a(n), we seek the "indefinite sum" S(n) determined (within an additive constant) by [Formula: see text] or, equivalently, by [Formula: see text] An algorithm is exhibited which, given a(n), finds those S(n) with the property [Formula: see text] With this algorithm, we can determine, for example, the three identities [Formula: see text] [Formula: see text] and [Formula: see text] and we can also conclude that [Formula: see text] is inexpressible as S(m) - S(0), for any S(n) satisfying Eq. 2.
منابع مشابه
Three Recitations on Holonomic Systems and Hypergeometric Series
When we teach calculus we have lectures and recitations. These notes are meant as “recitations” or something like “Schaum outlines” for the theory. The role of the “lectures” or “textbook” is provided by Gosper’s path-breaking paper “A Decision Procedure for Indefinite summation”, Proc. Nat. Acad. Sci. USA 75 (1978), 40-42, and by the following papers by myself and my collaborators, Gert Almkvi...
متن کاملSymbolic Summation | Some Recent Developments
In recent years, the problem of symbolic summation has received much attention due to the exciting applications of Zeilberger’s method for definite hypergeometric summation. This lead to renewed interest in the central part of the algorithmic machinery, Gosper’s “classical” method for indefinite hypergeometric summation. We review some of the recent (partly unpublished as yet) work done in this...
متن کاملA Generalization of Gosper's Algorithm to Bibasic Hypergeometric Summation
An algebraically motivated generalization of Gosper’s algorithm to indefinite bibasic hypergeometric summation is presented. In particular, it is shown how Paule’s concept of greatest factorial factorization of polynomials can be extended to the bibasic case. It turns out that most of the bibasic hypergeometric summation identities from literature can be proved and even found this way. A Mathem...
متن کاملMultibasic and Mixed Hypergeometric Gosper-Type Algorithms
Gosper’s summation algorithm finds a hypergeometric closed form of an indefinite sum of hypergeometric terms, if such a closed form exists. We extend his algorithm to the case when the terms are simultaneously hypergeometric and multibasic hypergeometric. We also provide algorithms for finding polynomial as well as hypergeometric solutions of recurrences in the mixed case. We do not require the...
متن کاملSolving Parameterized Linear Difference Equations In Terms of Indefinite Nested Sums and Products
Solving parameterized linear difference equations (problem PLDE) covers various prominent subproblems in symbolic summation [1]. For instance, by using PLDE-solvers for the rational case [2–6] or its q-analog version [7] one can find sum solutions of (q–)difference equations, see [8–10], or one can deal with telescoping and creative telescoping for ∂-finite summand expressions, see [11]. Moreov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Proceedings of the National Academy of Sciences of the United States of America
دوره 75 1 شماره
صفحات -
تاریخ انتشار 1978