Good bases for tame polynomials

From MaRDI portal
Publication:2456536

DOI10.1016/J.JSC.2004.10.001zbMATH Open1128.32017arXivmath/0306120OpenAlexW2100388026MaRDI QIDQ2456536FDOQ2456536


Authors: Mathias Schulze Edit this on Wikidata


Publication date: 19 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/0306120




Recommendations




Cites Work


Cited In (6)

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)