A normal form algorithm for the Brieskorn lattice

From MaRDI portal
Publication:2643559

DOI10.1016/J.JSC.2003.08.005zbMATH Open1137.14303arXivmath/0108144OpenAlexW2098873134MaRDI QIDQ2643559FDOQ2643559


Authors: Mathias Schulze Edit this on Wikidata


Publication date: 24 August 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: This article describes a normal form algorithm for the Brieskorn lattice of an isolated hypersurface singularity. It is the basis of efficient algorithms to compute the Bernstein-Sato polynomial, the complex monodromy, and Hodge-theoretic invariants of the singularity such as the spectral pairs and good bases of the Brieskorn lattice. The algorithm is a variant of Buchberger's normal form algorithm for power series rings using the idea of partial standard bases and adic convergence replacing termination.


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




Recommendations




Cites Work


Cited In (16)

Uses Software





This page was built for publication: A normal form algorithm for the Brieskorn lattice

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