Skip to main content
SpringerLink
Log in

The Normalization: a new Algorithm, Implementation and Comparisons

  • Conference paper
Computational Methods for Representations of Groups and Algebras

Part of the book series: Progress in Mathematics ((PM,volume 173))

Abstract

We present a new algorithm for computing the normalization \(\bar{R}\) of a reduced affine ring R, together with some remarks on efficiency based on our experience with an implementation of this algorithm in SINGULAR (cf. [2]).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Greuel, G.-M., Pfister, G.: Advances and improvements in the theory of standard bases and syzygies, Arch. Math. 66, 163–176 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  2. Greuel, G.-M., Pfister, G., Schönemann, H.: SINGULAR Reference Manual, Reports On Computer Algebra Number 12, May 1997, Centre for Computer Algebra, University of Kaiserslautern, http://www.mathematik.unikl.de/zca/Singular

  3. Grauert, H., Remmert, R.: Analytische Stellenalgebren, Springer 1971.

    Book  MATH  Google Scholar 

  4. Gianni, P., Trager, B.: Integral closure of noetherian rings, Proceedings ISSAC 97

    Google Scholar 

  5. de Jong, T.: An algorithm for computing the integral closure, J. of Symbolic Comp. 26, 273–277 (1998).

    Article  MATH  Google Scholar 

  6. Seidenberg, A.: Construction of the integral closure of a finite integral domain II, Proc. Amer. Math. Soc. 52, 368–372 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  7. Stolzenberg, G.: Constructive normalization of an algebraic variety, Bull. Amer. Math. Soc. 74, 595–599 (1968).

    Article  MathSciNet  MATH  Google Scholar 

  8. Vasconcelos, W.: Computing the integral closure of an affine domain, Proc. AMS 113 (3), 633–638 (1991).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. Wolfram Decker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Theo de Jong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gert-Martin Greuel
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gerhard Pfister
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Mathematik, Universität Bielefeld, Universitätsstr. 25, D-33615, Bielefeld, Germany

    P. Dräxler  & C. M. Ringel  & 

  2. Institut für Experimentelle Mathematik, Universität GH Essen, Ellernstr. 29, D-45326, Essen, Germany

    G. O. Michler

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Basel AG

About this paper

Cite this paper

Decker, W., de Jong, T., Greuel, GM., Pfister, G. (1999). The Normalization: a new Algorithm, Implementation and Comparisons. In: Dräxler, P., Ringel, C.M., Michler, G.O. (eds) Computational Methods for Representations of Groups and Algebras. Progress in Mathematics, vol 173. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8716-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8716-8_9

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9740-2

  • Online ISBN: 978-3-0348-8716-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation