The normalization: A new algorithm, implementation and comparisons

Authors W. Decker, Theo de Jong, Gert-Martin Greuel, Gerhard Pfister

Publication date 3 February 2000

implementation normalization algorithm normalization of the plane cuspical curve radical ideal

Software, source code, etc. for problems pertaining to commutative algebra (13-04) Integral closure of commutative rings and ideals (13B22) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Computational aspects of algebraic curves (14Q05)

Review text

The main result of the paper is a new normalization algorithm Normal(I [,inform]) that takes as input a radical ideal \(I\) from the polynomial ring \(K[x_{1},\ldots,x_{n}] \) and outputs \(s \) polynomial rings and \(s\) prime ideals and \(s\) maps \(R \rightarrow R_{i}\), such that the induced map \(K[x_{1},\ldots,x_{n}]/I \rightarrow R_{1}/I_{1} \times \ldots \times R_{s}/I_{s} \) is the normalization of \(K[x_{1},\ldots,x_{n}]/I \). Additional information about the problem can be given in the optional list ``inform, as for instance (i) I defines an isolated singularity; (ii) some elements of the radical of the non-normal locus, which are already known. An irreducible affine variety (and its affine domain) is called normal if the affine domain is integer closed. There are several normality criteria, e.g. by \textit{J.-P. Serre} [see \textit{H. Matsumura}, ``Commutative algebra (2nd edition 1980; Zbl 0441.13001)] and by \textit{I. R. Shafarevich} [``Basic algebraic geometry, Vol. I (Moscow 1988; Zbl 0675.14001)]. In the paper under review the authors' method (and algorithm) are based on the normality criterion of \textit{H. Grauert} and \textit{R. Remmert} [``Analytische Stellenalgebren (1971; Zbl 0231.32001)]. Let \(J\) be a radical ideal such that its zero set contains the non-normal locus of \( \operatorname {Spec} R\). The method is to present the set of homomorphisms from \(J\) to \(J\) over \(R\) as an affine ring, which is of type \(R[T_{1}, \ldots,T_{s}]\) modulo an ideal generated by linear (syzygies are used) and quadratic relations in \(T_i\). To have an efficient version of the normalization algorithm, the authors had to take care of several special cases and tricks for the implementation. An illustration of the algorithm by computing the normalization of the plane cuspidal curve is given. The above algorithm has been implemented by the authors; the implementation is available. The authors test the performance of the algorithm on six interesting examples and give timings for their implementation. The paper under review contains some misprints (e.g., on page 177, line 8 from above, read ``~\dots{} radical ideal \dots; on page 178, line 17 from below, read ``\dots \(+ a_{n-1}h^{n-1} +\) \dots; on page 182, line 3 from below, read ``\dots \(K[T_{1}]\). For the entire collection see [Zbl 0920.00022].

Recommendations

Cited in

(18)

Describes a project that uses

Uses Software

SINGULAR

This page was built for publication: The normalization: A new algorithm, implementation and comparisons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4270314)