A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Algorithmic proofs of two theorems of Stafford
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