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