Connection Matrices in Macaulay2
Connection Matrices in Macaulay2
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.
Paul G?rlach、Joris Koefler、Anna-Laura Sattelberger、Mahrud Sayrafi、Hendrik Schroeder、Nicolas Weiss、Francesca Zaffalon
数学
Paul G?rlach,Joris Koefler,Anna-Laura Sattelberger,Mahrud Sayrafi,Hendrik Schroeder,Nicolas Weiss,Francesca Zaffalon.Connection Matrices in Macaulay2[EB/OL].(2025-04-02)[2025-05-05].https://arxiv.org/abs/2504.01362.点此复制
评论