Details:
Title  Algorithmic proofs of two theorems of Stafford  Author(s)  Anton Leykin  Type  Article in Journal  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.  Keywords  Weyl algebra, D modules, Gröbner bases, Minimal generation  ISSN  07477171 
URL 
http://www.sciencedirect.com/science/article/pii/S0747717104001002 
Language  English  Journal  Journal of Symbolic Computation  Volume  38  Number  6  Pages  1535  1550  Year  2004  Edition  0  Translation 
No  Refereed 
No 
