Faster multivariate integration in D-modules
By: Hadrien Brochet, Frédéric Chyzak, Pierre Lairez
Potential Business Impact:
Solves hard math problems for counting special graphs.
We present a new algorithm for solving the reduction problem in the context of holonomic integrals, which in turn provides an approach to integration with parameters. Our method extends the Griffiths--Dwork reduction technique to holonomic systems and is implemented in Julia. While not yet outperforming creative telescoping in D-finite cases, it enhances computational capabilities within the holonomic framework. As an application, we derive a previously unattainable differential equation for the generating series of 8-regular graphs.
Similar Papers
Efficient Symbolic Computation via Hash Consing
Programming Languages
Makes math problems solve much faster.
A Unified Reduction for Hypergeometric and q-Hypergeometric Creative Telescoping
Symbolic Computation
Makes math problems with special numbers easier to solve.
Generalized ODE reduction algorithm for bounded degree transformation
Symbolic Computation
Simplifies hard math problems for computers.