Connection Matrices in Macaulay2
classification
🧮 math.AG
cs.SC
keywords
connectionimplementmacaulay2algebraalgorithmsarticlebasiscarrying
read the original abstract
In this article, we describe the theoretical foundations of the Macaulay2 package ConnectionMatrices and explain how to use it. For a left ideal in the Weyl algebra that is of finite holonomic rank, we implement the computation of the encoded system of linear PDEs in connection form with respect to an elimination term order that depends on a chosen positive weight vector. We also implement the gauge transformation for carrying out a change of basis over the field of rational functions. We demonstrate all implemented algorithms with examples.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.