Converging to Gosper's Algorithm
classification
🧮 math.CA
math.CO
keywords
algorithmfactorialgivengosperpropertyabramovapproachcoefficients
read the original abstract
Given two polynomials, we find a convergence property of the GCD of the rising factorial and the falling factorial. Based on this property, we present a unified approach to computing the universal denominators as given by Gosper's algorithm and Abramov's algorithm for finding rational solutions to linear difference equations with polynomial coefficients.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.