Good bases for tame polynomials

From MaRDI portal
Publication:2456536




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.





Describes a project that uses

Uses Software





This page was built for publication: Good bases for tame polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456536)