arXiv · math/0306120
Good bases for tame polynomials
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.
Explore related subjects
Keep this discovery
Mathias Schulze. 2004-12-01. Good bases for tame polynomials. https://doi.org/10.1016/j.jsc.2004.10.001
Cite the original work for its findings. Save a collection to share your selection of sources.