Computing the Bernstein Polynomial and the Krull-type Dimension of finitely generated $\boldsymbol{D}$-modules
Harry Prieto

TL;DR
This paper introduces a constructive method to compute the Bernstein polynomial for finitely generated D-modules over the Weyl algebra, and explores its implications for understanding module structure through Krull-type dimension.
Contribution
It provides a systematic, explicit approach to compute the Bernstein polynomial and its invariants for D-modules, extending Gr"obner basis theory to this context.
Findings
Explicit method for Bernstein polynomial computation
Development of Krull-type dimension for D-modules
Enhanced understanding of D-module structure
Abstract
We establish the existence of the Bernstein polynomial in one indeterminate , and provide a method for its explicit computation. The Bernstein polynomial is associated with finitely generated modules over the Weyl algebra, known as -modules, and is notoriously difficult to compute directly. Our approach is constructive, offering a systematic method to compute the Bernstein polynomial and its associated invariants explicitly. We begin by introducing the Weyl algebra as a ring of operators and stating some of its main properties, followed by considering the class of numerical polynomials. We then develop a generalization of the theory of Gr\"obner bases specifically for -modules and use it to compute the Bernstein polynomial and its invariants. As an application of the properties of the Bernstein polynomial, we develop the concept of the Krull-type dimension for -modules,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Rings, Modules, and Algebras · Polynomial and algebraic computation
