Algorithmic proofs of two theorems of Stafford
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. (C) 2004 Elsevier Ltd. All rights reserved.
weyl algebra d-modules grobner bases minimal generation