Computing localizations iteratively.

DOI10.1142/9789814383462_0003MaRDI QIDQ2812489zbMATH OpenOpenAlexFDO

Authors Anton Leykin, Francisco J. Castro-Jiménez

Publication date 16 June 2016

Published in Harmony of Gröbner Bases and the Modern Industrial Society - The Second CREST-CSBM International Conference (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1110.0182

zbMATH Keywords

algorithmsannihilatorslocalizationsplanar curvesWeyl algebras

Mathematics Subject Classification ID

Differentials and other special sheaves; D-modules; Bernstein-Sato ideals and polynomials (14F10) Rings of differential operators (associative algebraic aspects) (16S32) Computational aspects of associative rings (general theory) (16Z05) Sheaves of differential operators and their modules, (D)-modules (32C38)

Abstract: Let $$ be a polynomial ring with complex coefficients and $$ be the Weyl algebra. Describing the localization $R_f=R[f^{-1}]$ for nonzero $finR$ as a $Dx$-module amounts to computing the annihilator $A=Ann(f^a)subsetDx$ 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.

Recommendations

• A localization algorithm for \(D\)-modules
• Annihilating ideals for an algebraic local cohomology class
• scientific article; zbMATH DE number 3931151
• Localization at hyperplane arrangements: combinatorics and \({\mathcal D}\)-modules
• Algorithmic computation of local cohomology modules and the local cohomological dimension of algebraic varieties

Cited in

(3)

• Computing a representation of the local environment
• Scattering amplitude annihilators
• Localization at hyperplane arrangements: combinatorics and \({\mathcal D}\)-modules

This page was built for publication: Computing localizations iteratively.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2812489)