Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

JSC
2010

favoriteEmaildiscussreport

63views more JSC 2010»

Normalization of rings

13 years 3 months ago

Normalization of rings

Download www.mathematik.uni-kl.de

We present a new algorithm to compute the integral closure of a reduced Noetherian ring in its total ring of fractions. A modiﬁcation, 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 aﬃne 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. Key words: normalization, integral closure, test ideal, Grauert-Remmert criterion

Gert-Martin Greuel, Santiago Laplagne, Frank Seeli

Real-time Traffic

Arbitrary Monomial Orderings | Integral Closure | JSC 2010 | Total Ring |

claim paper

Related Content

» A Normal Form for Function Rings of Piecewise Functions

» An adaptive spiketimingdependent plasticity rule

» Torsion units in integral group rings of Janko simple groups

» Ideal decompositions and computation of tensor normal forms

» Some Performance Studies in Exact Linear Algebra

» Fault Tolerant Active Rings for Structured PeertoPeer Overlays

» Incremental query evaluation in a ring of databases

» RMAT A Recursive Model for Graph Mining

» Survivable Routing in WDM Weighted Networks

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	JSC
Authors	Gert-Martin Greuel, Santiago Laplagne, Frank Seelisch

Comments (0)