Newton trees for ideals in two variables and applications

Details Newton trees for ideals in two variables and applications Newton trees for ideals in two variables and applications

2012-01-02

arxiv.org/abs/1201.0467v1

Mathematics

Algebraic Geometry

37 pages

Scientific paper

We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For instance when the ideal is of finite codimension, invariants like integral closure and Hilbert-Samuel multiplicity were already combinatorially determined in the very special cases of monomial or non degenerate ideals, using the Newton polygon of the ideal. With our approach, we can generalize these results to arbitrary ideals. In particular the Rees valuations of the ideal will correspond to the so-called dicritical vertices of the tree, and its Hilbert-Samuel multiplicity has a nice and easily computable description in terms of the tree.

Affiliated with

Also associated with

No associations

Rating

Newton trees for ideals in two variables and applications 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 Newton trees for ideals in two variables and applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Newton trees for ideals in two variables and applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-55526