Divisorial Extensions and the Computation of Integral Closures

We provide a setting for analyzing the efficiency of algorithms that compute the integral closure of affine rings. It gives quadratic (cubic in the non-homogeneous case) multiplicity-based but dimension-independent bounds for the number of passes the basic construction will make. An approach that does not usesJacobian ideals is examined in detail.