Good bases for tame polynomials

Details Good bases for tame polynomials Good bases for tame polynomials

2003-06-06

arxiv.org/abs/math/0306120v3

J. Symb. Comp. 39,1 (2005), 103-126

Mathematics

Algebraic Geometry

28 pages, 0 figures, http://www.mathematik.uni-kl.de/~mschulze

Scientific paper

10.1016/j.jsc.2004.10.001

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.

Affiliated with

Also associated with

No associations

Rating

Good bases for tame polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Good bases for tame polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Good bases for tame polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-435060