Algorithmic proofs of two theorems of Stafford

Details Algorithmic proofs of two theorems of Stafford Algorithmic proofs of two theorems of Stafford

2002-04-24

arxiv.org/abs/math/0204303v2

Mathematics

Rings and Algebras

12 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Algorithmic proofs of two theorems of Stafford does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithmic proofs of two theorems of Stafford, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic proofs of two theorems of Stafford will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1283