Normalization of rings

DOI10.1016/J.JSC.2010.04.002zbMATH Open1200.13015arXiv0904.3561OpenAlexW1993550385MaRDI QIDQ987700FDOQ987700

Authors: Gert-Martin Greuel, Santiago Laplagne, Frank Seelisch 

Publication date: 13 August 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: We present a new algorithm to compute the integral closure of a reduced Noetherian ring in its total ring of fractions. A modification, applicable in positive characteristic, where actually all computations are over the original ring, is also described. The new algorithm of this paper has been implemented in Singular, for localizations of affine rings with respect to arbitrary monomial orderings. Benchmark tests show that it is in general much faster than any other implementation of normalization algorithms known to us.

Full work available at URL: https://arxiv.org/abs/0904.3561

Recommendations

• scientific article; zbMATH DE number 1996523
• scientific article; zbMATH DE number 1253986
• LOCAL ANALYSIS OF GRAUERT–REMMERT-TYPE NORMALIZATION ALGORITHMS
• scientific article; zbMATH DE number 1361357
• Parallel algorithms for normalization

zbMATH Keywords

algorithmsintegral closurenormalizationtest idealsdelta-invariants\texttt{Singular}

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Integral closure of commutative rings and ideals (13B22) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Cites Work

• The Magma algebra system. I: The user language
• Title not available (Why is that?)
• SINGULAR
• Title not available (Why is that?)
• Integral closure of ideals, rings, and modules
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The construction of maximal orders over a Dedekind domain
• On commutative endomorphism rings
• Computing the Integral Closure of an Affine Domain
• An algorithm for computing the integral closure
• Divisorial extensions and the computation of integral closures
• Computing the radical of an ideal in positive characteristic
• Constructive normalization of an algebraic variety
• Construction of the Integral Closure of a Finite Integral Domain. II
• Construction of the integral closure of a finite integral domain
• Title not available (Why is that?)
• Integral closures and weight functions over finite fields.
• Equisingular calculations for plane curve singularities
• Title not available (Why is that?)
• On the structure of closed ideals
• An algorithm for computing the integral closure

Cited In (28)

• Bad Primes in Computational Algebraic Geometry
• Title not available (Why is that?)
• Normalizing isomorphisms between Burnside rings
• Integral closures and weight functions over finite fields.
• Degenerations of algebras and ranks of Grothendieck groups
• The cohomology annihilator of a curve singularity
• Comments on \textit{Integration of algebraic functions}
• Title not available (Why is that?)
• Computing in quotients of rings of integers
• Three algorithms in algebraic geometry, coding theory and singularity theory
• Embedded desingularization for arithmetic surfaces -- toward a parallel implementation
• Local to global algorithms for the Gorenstein adjoint ideal of a curve
• Parallel algorithms for normalization
• Computing integral bases via localization and Hensel lifting
• Two algorithms for computing the general component of jet scheme and applications
• Title not available (Why is that?)
• Desingularization of Arithmetic Surfaces: Algorithmic Aspects
• An algorithm for the Traverso-Swan theorem on seminormal rings
• Computing the binomial part of a polynomial ideal
• Title not available (Why is that?)
• Gorenstein endomorphism rings on curve singularities
• On singularities of real algebraic sets and applications to kinematics
• Computing the integral closure of an ideal using its Rees algebra
• Reduced normal form of local integral bases
• Integral closure
• The use of bad primes in rational reconstruction
• Partial orders and CB-degeneration relation.
• LOCAL ANALYSIS OF GRAUERT–REMMERT-TYPE NORMALIZATION ALGORITHMS

Uses Software

• CoCoA
• Macaulay2
• Magma
• Normaliz
• SINGULAR

This page was built for publication: Normalization of rings

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