A normal form algorithm for the Brieskorn lattice
| dc.creator | Schulze, Mathias | |
| dc.date | 2001-08-21 | |
| dc.date | 2004-08-15 | |
| dc.date.accessioned | 2026-07-07T04:43:04Z | |
| dc.date.available | 2026-07-07T04:43:04Z | |
| dc.description | 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. | |
| dc.description | 23 pages, 1 figure, 4 tables | |
| dc.identifier | https://arxiv.org/abs/math/0108144 | |
| dc.identifier | http://arxiv.org/abs/math/0108144 | |
| dc.identifier | J. Symb. Comp. 38,4 (2004), 1207-1225 | |
| dc.identifier | doi:10.1016/j.jsc.2003.08.005 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/62056 | |
| dc.subject | Complex Variables | |
| dc.subject | Commutative Algebra | |
| dc.subject | 13N10; 13P10; 32S35; 32S40 | |
| dc.title | A normal form algorithm for the Brieskorn lattice | |
| dc.type | text |