A normal form algorithm for the Brieskorn lattice
Complex Variables
2007-05-23 v5 Commutative Algebra
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.
Cite
@article{arxiv.math/0108144,
title = {A normal form algorithm for the Brieskorn lattice},
author = {Mathias Schulze},
journal= {arXiv preprint arXiv:math/0108144},
year = {2007}
}
Comments
23 pages, 1 figure, 4 tables