English

Algorithmic proofs of two theorems of Stafford

Rings and Algebras 2007-05-23 v2 Algebraic Geometry

Abstract

Two classical results of Stafford say that every (left) ideal of the nn-th Weyl algebra AnA_n can be generated by two elements, and every holonomic AnA_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

Cite

@article{arxiv.math/0204303,
  title  = {Algorithmic proofs of two theorems of Stafford},
  author = {Anton Leykin},
  journal= {arXiv preprint arXiv:math/0204303},
  year   = {2007}
}

Comments

12 pages