A normal form algorithm for the Brieskorn lattice
Mathias Schulze
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.
Create a lesson
Related papers
Maximum-modulus points on concentric circles
Yunpeng Li
Exponential Green energies, quantization, and minimizers on compact Riemann surfaces
Haakan Hedenmalm, Song-Yan Xie
Uniform Green packing on compact Riemann surfaces
Haakan Hedenmalm, Song-Yan Xie
Averaged derivatives and reverse inequalities in quasiregular Bergman spaces
Suman Das
Absolute moments of GH distribution
Chuancun Yin
Characterizations for quasiconformal weighted Bergman spaces
Pekka Koskela, Chengxi Li, Abhishek Pandey