Singular

Thanks for your help! (Sorry for the delay)

Regarding the meaningful examples (benchmarks), I guess already in the case of plane curve singularities with a few Puiseux pairs the computation (as above) can be quite non-trivial.

The library reesclos.lib was somewhat outdated since it relied on its own
version of de Jong's normalization algorithm and not on the much faster
algorithms by Greuel, Laplagne, and Seelisch respectively Boehm, Decker,
Laplagne, Pfister, Steenpass, and Steidel. The latter algorithms are implemented
in the libraries normal.lib respectively locnormal.lib.

We have now fixed the library reesclos.lib accordingly. The newest version can
be downloaded from our GIT respository and will be part of the next Singular
release. First tests show that Singular is now faster than Macaulay2.

For further tests, can you provide us with meaningful examples you are
interested in?

Thanks for informing us about the problem!

Wolfram

Thanks!

Indeed, in Macaulay it works unbelievably fast!!
(Or, rather: I'm doing smth very stupid in Singular, thus it goes very slowly)

Well I have had mixed timing results using either normalI in Singular's reesclos.lib or integralClosure(I) in Macaulay2.
I have posted a couple annotated examples on my website
www.dms.auburn.edu/~leonada

If you have tried Macaulay2, I have some code for integral closures of ideals in positive charateristic
that I am testing, and a paper submitted to go along with it.

Doug

I need to compute the integral closures of ideals (ie.g. in k[[x,y]]). So, I'm playing with the following:

LIB "reesclos.lib";
ring r=0,(x,y),dp;
poly f=.....
ideal I=x*diff(f,x),y*diff(f,y);
list JJ=normalI(I);

for weighted homogeneous cases (e.g. f=x^p+y^q) the answer comes quickly. For non-weighted homogeneous, but Newton-non-degenerate (e.g. f=x^5+x^2*y^2+y^5) I could not get the answer in char=0, but at least the computation is successful for : >>>ring r=11,(x,y),dp;

In the simplest degenerate case, f=(x^2-y^3)^2+x*y^4;, I could not get the answer even in char=11. (After several minutes I just stopped Singular.)


Am I doing smth wrong/stupid?
Are there any faster ways to compute the integral closures of ideals?


Thanks!