|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Good bases for tame polynomials | | Mathias Schulze
; | | Date: |
6 Jun 2003 | | Journal: | J. Symb. Comp. 39,1 (2005), 103-126 DOI: 10.1016/j.jsc.2004.10.001 | | Subject: | Algebraic Geometry; Commutative Algebra MSC-class: 68W30; 32C38 | math.AG math.AC | | Abstract: | An algorithm to compute a good basis of the Brieskorn lattice of a cohomologically tame polynomial is described. This algorithm is based on the results of C. Sabbah and generalizes the algorithm by A. Douai for convenient Newton non-degenerate polynomials. | | Source: | arXiv, math.AG/0306120 | | 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 Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER