The factorial-basis method for finding definite-sum solutions of linear recurrences with polynomial coefficients

Antonio Jiménez-Pastor, Marko Petkovšek

Research output: Contribution to journalJournal articleResearchpeer-review

2 Citations (Scopus)

Abstract

The problem of finding a nonzero solution of a linear recurrence Ly=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, Sec. 8), has now been open for three decades. Here we present an algorithm (implemented in a SageMath package) which, given such a recurrence and a quasi-triangular, shift-compatible factorial basis B=〈P k(n)〉 k=0 of the polynomial space K[n] over a field K of characteristic zero, computes a recurrence satisfied by the coefficient sequence c=〈c kk=0 of the solution y n=∑ k=0 c kP k(n) (where, thanks to the quasi-triangularity of B, the sum on the right terminates for each n∈N). More generally, if B is m-sieved for some m∈N, our algorithm computes a system of m recurrences satisfied by the m-sections of the coefficient sequence c. If an explicit nonzero solution of this system can be found, we obtain an explicit nonzero solution of Ly=0.

Original languageEnglish
JournalJournal of Symbolic Computation
Volume117
Pages (from-to)15-50
Number of pages36
ISSN0747-7171
DOIs
Publication statusPublished - Jul 2023
Externally publishedYes

Keywords

  • Binomial-coefficient bases
  • Definite hypergeometric sums
  • Quasi-triangular bases
  • Shift-compatible factorial bases
  • Solutions of linear recurrences
  • polynomial series

Fingerprint

Dive into the research topics of 'The factorial-basis method for finding definite-sum solutions of linear recurrences with polynomial coefficients'. Together they form a unique fingerprint.

Cite this