an:00027145
Zbl 0755.13012
Conti, Pasqualina; Traverso, Carlo
Computing the conductor of an integral extension
EN
Discrete Appl. Math. 33, No. 1-3, 61-72 (1991).
00182871
1991
j
13P99 13B02 13B22
integral closure; conductor of an extension of rings; subring inclusion; birational equivalence
Summary: We describe algorithms to solve different problems in commutative algebra. These algorithms are linked by the fact that they are useful in considering integral extensions (integral closure, weak integral closure, etc.).
The first algorithm computes the conductor of an extension of rings. The algorithm is based on the computation of the inverse image of a submodule relative to a module homomorphism. This problem is solved lifting suitably to free modules over polynomial rings. To complete the computation of the conductor one has to represent an integral extension as a finitely presented module; we give an algorithm for this, that at the same time verifies that the extension is integral. --- Other algorithms are given that test subring inclusion and birational equivalence. These algorithms are not strictly necessary to perform the conductor computation, but are in some sense connected to the former problem, since if the answer to these tests is negative then the conductor is trivial.