Systems of homogeneous, linear partial differential equations (PDEs) with polynomial coefficients are encoded by left ideals in the Weyl algebra, denoted $$ D_n=\CC[x_1,\ldots,x_n]\langle \partial_1,\ldots,\partial_n \rangle. $$ Such systems can be systematically written as a first-order matrix system known as a "Pfaffian system" or "connection form," by utilizing Gröbner bases in the Weyl algebra [SST, p. 37]. The systematic computation of connection matrices requires Gröbner basis computations in the rational Weyl algebra $$ R_n=\CC(x_1,\ldots,x_n)\langle \partial_1,\ldots,\partial_n \rangle. $$
The theoretical foundations of our algorithms is described the companion paper to this package, available at arXiv:2504.01362.
Work on this package began at the workshop Macaulay2 in the Sciences held at MPI-MiS in Leipzig in November 2024. Devlin Mallory and Carlos Gustavo Rodriguez Fernandez contributed to the development of this package during the workshop.
The main reference for our algorithms is the book [SST] M. Saito, B. Sturmfels, and N. Takayama Gröbner Deformations of Hypergeometric Differential Equations, volume 6 of Algorithms and Computation in Mathematics. Springer, 2000.
This documentation describes version 1.0 of ConnectionMatrices.
If you have used this package in your research, please cite it as follows:
|
The object ConnectionMatrices is a package, defined in ConnectionMatrices.m2, with auxiliary files in ConnectionMatrices/.
The source of this document is in ConnectionMatrices/docs.m2:60:0.