Abstract | ||
---|---|---|
We present a new algorithm to compute the integral closure of a reduced Noetherian ring in its total ring of fractions. A modification, applicable in positive characteristic, where actually all computations are over the original ring, is also described. The new algorithm of this paper has been implemented in Singular, for localizations of affine rings with respect to arbitrary monomial orderings. Benchmark tests show that it is in general much faster than any other implementation of normalization algorithms known to us. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1016/j.jsc.2010.04.002 | J. Symb. Comput. |
Keywords | DocType | Volume |
Integral closure,Grauert–Remmert criterion,affine ring,total ring,original ring,positive characteristic,new algorithm,Benchmark test,arbitrary monomial ordering,grauert-remmert criterion .,reduced Noetherian ring,Test ideal,. normalization,Normalization,test ideal,normalization algorithm,integral closure | Journal | 45 |
Issue | ISSN | Citations |
9 | Journal of Symbolic Computation | 1 |
PageRank | References | Authors |
0.40 | 5 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Gert-Martin Greuel | 1 | 108 | 14.96 |
Santiago Laplagne | 2 | 13 | 2.84 |
Frank Seelisch | 3 | 7 | 3.13 |