Good bases for tame polynomials
代数几何
2007-05-23 v3 交换代数
摘要
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.
引用
@article{arxiv.math/0306120,
title = {Good bases for tame polynomials},
author = {Mathias Schulze},
journal= {arXiv preprint arXiv:math/0306120},
year = {2007}
}
备注
28 pages, 0 figures, http://www.mathematik.uni-kl.de/~mschulze