Good bases for tame polynomials

2003/06/30 by Mathias Schulze
Mathematics · #math.AG #math.AC #msc:68W30 #msc:32C38

paper · pdf · doi:10.1016/j.jsc.2004.10.001

published as J. Symb. Comp. 39,1 (2005), 103-126 · 28 pages, 0 figures, http://www.mathematik.uni-kl.de/~mschulze

arxiv created 2004/12/01 · arxiv updated 2009/11/30

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.

Related

• A normal form algorithm for the Brieskorn lattice
• Hall polynomials for tame type
• Discriminant method for the homological monodromy of tame polynomials
• The Proper Basis for Polynomial Ideals
• On the structure of Brieskorn lattices, II