Good bases for tame polynomials

Simple item page
dc.creatorSchulze, Mathias
dc.date2003-06-06
dc.date2004-12-01
dc.date.accessioned2026-07-07T04:58:38Z
dc.date.available2026-07-07T04:58:38Z
dc.descriptionAn 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.
dc.description28 pages, 0 figures, http://www.mathematik.uni-kl.de/~mschulze
dc.identifierhttps://arxiv.org/abs/math/0306120
dc.identifierhttp://arxiv.org/abs/math/0306120
dc.identifierJ. Symb. Comp. 39,1 (2005), 103-126
dc.identifierdoi:10.1016/j.jsc.2004.10.001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67721
dc.subjectAlgebraic Geometry
dc.subjectCommutative Algebra
dc.subject68W30; 32C38
dc.titleGood bases for tame polynomials
dc.typetext

Files

Collections

arXiv