Creative telescoping for rational functions using the Griffiths-Dwork method
Alin Bostan (INRIA Saclay - Ile de France), Pierre Lairez (INRIA, Saclay - Ile de France), Bruno Salvy (Inria Grenoble Rh\^one-Alpes / LIP, Laboratoire de l'Informatique du Parall\'elisme)

TL;DR
This paper introduces an elementary algorithm based on the Griffiths-Dwork method for creative telescoping of rational functions, providing bounds on differential equation coefficients and a complexity analysis, implemented in a prototype.
Contribution
It presents a new, elementary algorithm for creative telescoping of rational functions that avoids computing certificates and offers complexity bounds.
Findings
Algorithm is elementary and precise.
Provides bounds on order and degree of differential equations.
First complexity result exponential in number of variables.
Abstract
Creative telescoping algorithms compute linear differential equations satisfied by multiple integrals with parameters. We describe a precise and elementary algorithmic version of the Griffiths-Dwork method for the creative telescoping of rational functions. This leads to bounds on the order and degree of the coefficients of the differential equation, and to the first complexity result which is simply exponential in the number of variables. One of the important features of the algorithm is that it does not need to compute certificates. The approach is vindicated by a prototype implementation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
