Castro Jiménez, Francisco JesúsLeykin, Anton2022-11-022022-11-022011Castro Jiménez, F.J. y Leykin, A. (2011). Computing localizations iteratively. https://doi.org/10.48550/arXiv.1110.0182.https://hdl.handle.net/11441/138592Let R = C[x] be a polynomial ring with complex coefficients and DX = Chx, ∂i be the Weyl algebra. Describing the localization Rf = R[f −1 ] for nonzero f ∈ R as a DX-module amounts to computing the annihilator A = Ann(f a ) ⊂ 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.application/pdf14 p.engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttps://doi.org/10.48550/arXiv.1110.0182