Papers
Topics
Authors
Recent
Search
2000 character limit reached

Monomial generators of complete planar ideals

Published 12 Jan 2017 in math.AG and math.AC | (1701.03503v3)

Abstract: We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the minimal log-resolution of the ideal. Furthermore, the monomial expression given by our method is an equisingularity invariant of the ideal. As an outcome, we provide a geometric method to compute the integral closure of a planar ideal and we apply our algorithm to some families of complete ideals.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.