Computing localizations iteratively

Details Computing localizations iteratively Computing localizations iteratively

2011-10-02

arxiv.org/abs/1110.0182v2

Mathematics

Algebraic Geometry

14 pages

Scientific paper

Let $R=\bC[\bfx]$ be a polynomial ring with complex coefficients and $\Dx = \bC$ be the Weyl algebra. Describing the localization $R_f = R[f^{-1}]$ for nonzero $f\in R$ as a $\Dx$-module amounts to computing the annihilator $A = \Ann(f^a)\subset \Dx$ of the cyclic generator $f^{a}$ for a suitable negative integer $a$. We construct an iterative algorithm that uses truncated annihilators to build $A$ for planar curves.

Affiliated with

Also associated with

No associations

Rating

Computing localizations iteratively 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 Computing localizations iteratively, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing localizations iteratively will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-284195