R' = integralClosure R
The integral closure of a domain is the subring of the fraction field consisting of all fractions integral over the domain. For example,






Sometimes using trim provides a cleaner set of generators.
If $R$ is not a domain, first decompose it, and collect all of the integral closures.





This function is roughly based on Theo De Jong's paper, An Algorithm for Computing the Integral Closure, J. Symbolic Computation, (1998) 26, 273277. This algorithm is similar to the round two algorithm of Zassenhaus in algebraic number theory.
There are several optional parameters which allows the user to control the way the integral closure is computed. These options may change in the future.
This function requires that the degree of the field extension (over a pure transcendental subfield) be greater than the characteristic of the base field. If not, use icFracP. This function requires that the ring be finitely generated over a ring. If not (e.g. if it is f.g. over the integers), then the result is integral, but not necessarily the entire integral closure. Finally, if the ring is not a domain, then the answers will often be incorrect, or an obscure error will occur.