Algorithmic proofs of two theorems of Stafford

@article{Leykin2004AlgorithmicPO,
  title={Algorithmic proofs of two theorems of Stafford},
  author={Anton Leykin},
  journal={J. Symb. Comput.},
  year={2004},
  volume={38},
  pages={1535-1550}
}
Two classical results of Stafford say that every (left) ideal of the n-th Weyl algebra An can be generated by two elements, and every holonomic An-module is cyclic, i.e. generated by one element. We modify Stafford’s original proofs to make the algorithmic computation of these generators possible. 
Highly Cited
This paper has 19 citations. REVIEW CITATIONS