2015/12/21 by Shalosh B. Ekhad, Doron Zeilberger, Ekhad, Shalosh B. +1
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Mathematical functions and polynomials #Polynomial and algebraic computation #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1512.06902
openalex publication_date 2015/12/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show how the continuous Almkvist-Zeilberger algorithm can be used to efficiently discover and prove differential equations satisfied by generating functions of sequences defined as integrals of powers of C-finite polynomial sequences (like the Chebyshev polynomials) from which one can automatically derive linear recurrences with polynomial coefficients for the sequences themselves. We fully implement this with a Maple package, CfiniteIntergal.txt .