• Title of article

    Algorithmic proofs of two theorems of Stafford

  • Author/Authors

    Anton Leykin، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2004
  • Pages
    16
  • From page
    1535
  • To page
    1550
  • Abstract
    Two classical results of Stafford say that every (left) ideal of the n-thWeyl algebra An can be generated by two elements, and every holonomicAn-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
    D-modules , Minimal generation , Gr?bner bases , Weyl algebra
  • Journal title
    Journal of Symbolic Computation
  • Serial Year
    2004
  • Journal title
    Journal of Symbolic Computation
  • Record number

    805819

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=805819