Papers
Topics
Authors
Recent
Search
2000 character limit reached

Computing an approximation of the partial Weyl closure of a holonomic module

Published 5 Feb 2026 in cs.SC | (2602.06209v1)

Abstract: The Weyl closure is a basic operation in algebraic analysis: it converts a system of differential operators with rational coefficients into an equivalent system with polynomial coefficients. In addition to encoding finer information on the singularities of the system, it serves as a preparatory step for many algorithms in symbolic integration. A new algorithm is introduced to approximate the partial Weyl closure of a holonomic module, where the closure is taken with respect to a subset of the variables. The method is based on a non-commutative generalization of Rabinowitsch's trick and yields a holonomic module included in the Weyl closure of the input system. The algorithm is implemented in the Julia package MultivariateCreativeTelescoping.jl and shows substantial speedups over existing exact Weyl closure algorithms in Singular and Macaulay2.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.