Algorithmic proofs of two theorems of Stafford.

From MaRDI portal
Publication:2643577

DOI10.1016/J.JSC.2004.07.003zbMATH Open1130.16304arXivmath/0204303OpenAlexW2005759996MaRDI QIDQ2643577FDOQ2643577


Authors: Anton Leykin Edit this on Wikidata


Publication date: 24 August 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/math/0204303




Recommendations




Cites Work


Cited In (12)

Uses Software





This page was built for publication: Algorithmic proofs of two theorems of Stafford.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643577)