Creative telescoping for rational functions using the Griffiths-Dwork method

DOI10.1145/2465506.2465935zbMATH Open1360.68921arXiv1301.4313OpenAlexW3105373387MaRDI QIDQ2963221FDOQ2963221

Authors: Alin Bostan, Pierre Lairez, Bruno Salvy 

Publication date: 10 February 2017

Published in: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1301.4313

Recommendations

• Efficient rational creative telescoping
• Trading order for degree in creative telescoping
• Complexity of creative telescoping for bivariate rational functions
• A fast approach to creative telescoping
• On the existence of telescopers for rational functions in three variables

zbMATH Keywords

algorithmscomplexityintegrationPicard-Fuchs equationcreative telescopingGriffiths-Dwork method

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Abstract differential equations (12H20) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Cited In (32)

• Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
• Efficient rational creative telescoping
• Creative telescoping for holonomic functions
• Algebraic diagonals and walks: algorithms, bounds, complexity
• A numerical transcendental method in algebraic geometry: computation of Picard groups and related invariants
• Algorithm for differential equations for Feynman integrals in general dimensions
• On some combinatorial sequences associated to invariant theory
• Trading order for degree in creative telescoping
• Effective homology and periods of complex projective hypersurfaces
• Computing periods of rational integrals
• Polynomial reduction for holonomic sequences and applications in \(\pi\)-series and congruences
• Beating binary powering for polynomial matrices
• A fast approach to creative telescoping
• Constructing minimal telescopers for rational functions in three discrete variables
• Telescopers for differential forms with one parameter
• On the existence of telescopers for rational functions in three variables
• On a class of hypergeometric diagonals
• Reduction-based creative telescoping for Fuchsian D-finite functions
• Multiple binomial sums
• Linear differential equations as a data structure
• Parallel telescoping and parameterized Picard-Vessiot theory
• Constructing reductions for creative telescoping. The general differentially finite case
• Complexity of creative telescoping for bivariate rational functions
• Computer algebra in the service of enumerative combinatorics
• Lazy Hermite reduction and creative telescoping for algebraic functions
• Diagonal Asymptotics for Products of Combinatorial Classes
• Tableau sequences, open diagrams, and Baxter families
• Algorithms for minimal Picard-Fuchs operators of Feynman integrals
• Reduction-based creative telescoping for definite summation of D-finite functions
• Some open problems related to creative telescoping
• Diagonals of rational functions, pullbacked \(\mathbf{_2F_1}\) hypergeometric functions and modular forms
• A diagrammatic approach to the AJ conjecture

This page was built for publication: Creative telescoping for rational functions using the Griffiths-Dwork method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963221)