arXiv · math/0204303
Algorithmic proofs of two theorems of Stafford
Abstract
Two classical results of Stafford say that every (left) ideal of the $n$-th Weyl algebra $A_n$ can be generated by two elements, and every holonomic $A_n$-module is cyclic, i.e. generated by one element. We modify Stafford's original proofs to make the algorithmic computation of these generators possible.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Anton Leykin. 2002-05-12. Algorithmic proofs of two theorems of Stafford. https://arxiv.org/abs/math/0204303
Cite the original work for its findings. Save a collection to share your selection of sources.