Artículo
Computing localizations iteratively
Autor/es | Castro Jiménez, Francisco Jesús
Leykin, Anton |
Departamento | Universidad de Sevilla. Departamento de Álgebra |
Fecha de publicación | 2011 |
Fecha de depósito | 2022-11-02 |
Publicado en |
|
Resumen | Let 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 = ... Let 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. |
Cita | Castro Jiménez, F.J. y Leykin, A. (2011). Computing localizations iteratively. https://doi.org/10.48550/arXiv.1110.0182. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
1110.0182.pdf | 208.8Kb | [PDF] | Ver/ | |