Efficient Algorithms for Mixed Creative Telscoping

DOI10.1145/2930889.2930907zbMath1429.68335arXiv1605.05082OpenAlexW2395656192MaRDI QIDQ2985817

Louis Dumont, Alin Bostan, Bruno Salvy

Publication date: 10 May 2017

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

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

zbMATH Keywords

symbolic integrationcreative telescopingHermite reductionhypergeometric-hyperexponential term

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Related Items (6)

Martin boundary of killed random walks on isoradial graphs ⋮ Some open problems related to creative telescoping ⋮ Constructing reductions for creative telescoping. The general differentially finite case ⋮ Stieltjes moment sequences for pattern-avoiding permutations ⋮ Linear differential equations as a data structure ⋮ The SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals

This page was built for publication: Efficient Algorithms for Mixed Creative Telscoping