# Computing localizations iteratively

@article{CastroJimnez2011ComputingLI,
title={Computing localizations iteratively},
author={F. Castro-Jim{\'e}nez and A. Leykin},
journal={arXiv: Algebraic Geometry},
year={2011}
}
• Published 2011
• Mathematics
• arXiv: Algebraic Geometry
• 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.
2 Citations
Scattering amplitude annihilators
• Physics, Mathematics
• 2019
• 3
• PDF

#### References

SHOWING 1-10 OF 11 REFERENCES