Algorithms for D-modules --- restriction, tensor product, localization, and local cohomology groups
Abstract
We describe algorithms for computing various functors for algebraic D-modules, i.e. systems of linear partial differential equations with polynomial coefficients. We will give algorithms for restriction, tensor product, localization, and local cohomology groups for all degrees.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.