arXiv · math/0108144
A normal form algorithm for the Brieskorn lattice
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.
Explore related subjects
Keep this discovery
Mathias Schulze. 2004-08-15. A normal form algorithm for the Brieskorn lattice. https://doi.org/10.1016/j.jsc.2003.08.005
Cite the original work for its findings. Save a collection to share your selection of sources.