Abstract
Generating function techniques have been used throughout the literature to evaluate summations and recurrences. Rational generating functions are a particularly effective computation tool, as they encode all linear recurrence sequences. These are sequences defined by homogeneous linear recurrences with constant coefficients. There are known generating function techniques for evaluating summations and convolutions that involve linear recurrence sequences. Unfortunately, these methods do not lend themselves well to hand calculation.
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.
