Towards a direct method for finding hypergeometric solutions of linear first order recurrence systems
Abstract
References
Recommendations
Recurrence equations and their classical orthogonal polynomial solutions
Orthogonal systems and applicationsThe classical orthogonal polynomials are given as the polynomial solutions p"n(x) of the differential equation@s(x)y''(x)+@t(x)y^'(x)+@l"ny(x)=0,where @s(x) is a polynomial of at most second degree and @t(x) is a polynomial of first degree. In this ...
Laurent, Rational, and Hypergeometric Solutions of Linear q-Difference Systems of Arbitrary Order with Polynomial Coefficients
Systems of linear q-difference equations with polynomial coefficients are considered. Equations in the system may have arbitrary orders. For such systems, algorithms for searching polynomial, rational, and hypergeometric solutions, as well as solutions ...
The factorial-basis method for finding definite-sum solutions of linear recurrences with polynomial coefficients
AbstractThe problem of finding a nonzero solution of a linear recurrence L y = 0 with polynomial coefficients where y has the form of a definite hypergeometric sum, related to the Inverse Creative Telescoping Problem of Chen and Kauers (2017, ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 39Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in