Algorithmic proofs of two theorems of Stafford

Anton Leykin
2004 Journal of symbolic computation  
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.
doi:10.1016/j.jsc.2004.07.003 fatcat:qkvba5vedrcl7ng552adwluyhi