Abstract
The bivariate difference field provides an algebraic framework to study sequences satisfying a recurrence of order two, and it can be used to transform summations involving such sequences into first order difference equations over the bivariate difference field. Based on this, we present an algorithm for finding a series of polynomial solutions of such equations in the bivariate difference field, and show an upper bound on the degree of any possible polynomial solutions, which in turn is sufficient to compute all polynomial solutions by using the method of undetermined coefficients.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
