Algorithmic proofs of two theorems of Stafford
| dc.creator | Leykin, Anton | |
| dc.date | 2002-04-24 | |
| dc.date | 2002-05-12 | |
| dc.date.accessioned | 2026-07-07T04:48:04Z | |
| dc.date.available | 2026-07-07T04:48:04Z | |
| dc.description | 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. | |
| dc.description | 12 pages | |
| dc.identifier | https://arxiv.org/abs/math/0204303 | |
| dc.identifier | http://arxiv.org/abs/math/0204303 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/63909 | |
| dc.subject | Rings and Algebras | |
| dc.subject | Algebraic Geometry | |
| dc.subject | 16S32(Primary), 14Q20 (Secondary) | |
| dc.title | Algorithmic proofs of two theorems of Stafford | |
| dc.type | text |