Normalization of rings (Q987700)

The paper under review presents a new algorithm to compute the integral closure of a reduced Noetherian ring in its total ring of fraction. Several algorithms have been already designed in the past years, but most of them are not practical from a computational point of view due to the fact that the tools not only involve Gröbner bases, but also they must extend the ground field and add new indeterminates. The novelty of the algorithm presented in this paper is the fact that most of the computations are done over the original ring without adding new variables or relations. As an application of the tools used for the proof, it is also shown how to compute the so-called \(\delta\)-invariant of the ring. The authors claim that their algorithm has been implemented in the computer software \texttt{Singular}, there is a section of benchmark examples and comparisons with previous algorithms, which seems to show that in general the new algorithm is faster than any other implementation of the normalization of rings. The paper concludes with an extension of the algorithm to non-global monomial orderings.