|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'500'096
Articles rated: 2609
18 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A normal form algorithm for the Brieskorn lattice | | Mathias Schulze
; | | Date: |
21 Aug 2001 | | Journal: | J. Symb. Comp. 38,4 (2004), 1207-1225 DOI: 10.1016/j.jsc.2003.08.005 | | Subject: | Complex Variables; Commutative Algebra MSC-class: 13N10; 13P10; 32S35; 32S40 | math.CV math.AC | | 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. | | Source: | arXiv, math.CV/0108144 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER