Ver ítem 

Mostrar el registro sencillo del ítem

Artículo

Opened Access
Computing localizations iteratively

dc.creatorCastro Jiménez, Francisco Jesúses
dc.creatorLeykin, Antones
dc.date.accessioned2022-11-02T11:56:43Z
dc.date.available2022-11-02T11:56:43Z
dc.date.issued2011
dc.identifier.citationCastro Jiménez, F.J. y Leykin, A. (2011). Computing localizations iteratively. https://doi.org/10.48550/arXiv.1110.0182.
dc.identifier.urihttps://hdl.handle.net/11441/138592
dc.description.abstractLet 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.es
dc.formatapplication/pdfes
dc.format.extent14 p.es
dc.language.isoenges
dc.publisherCornell Universityes
dc.relation.ispartofnull
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleComputing localizations iterativelyes
dc.typeinfo:eu-repo/semantics/articlees
dcterms.identifierhttps://ror.org/03yxnpp24
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Álgebraes
dc.relation.publisherversionhttps://doi.org/10.48550/arXiv.1110.0182es
dc.identifier.doi10.48550/arXiv.1110.0182es
dc.publication.initialPage1es
dc.publication.endPage14es

FicherosTamañoFormatoVerDescripción
1110.0182.pdf208.8KbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional