Algoritmos de normalización de anillos
We present an algorithm to compute the integral closure of a reduced Noetherian ring in its total ring of fractions. The algorithm of this paper has been implemented in SINGULAR.. Benchmark tests show that it is in general much faster than any other implementation of normalization algorithms known t...
| 1. Verfasser: | |
|---|---|
| Format: | Documento de Conferencia |
| Sprache: | spa |
| Veröffentlicht: |
2021
|
| Online Zugang: | http://repositorio.uptc.edu.co/handle/001/7816 |
| Zusammenfassung: | We present an algorithm to compute the integral closure of a reduced Noetherian ring in its total ring of fractions. The algorithm of this paper has been implemented in SINGULAR.. Benchmark tests show that it is in general much faster than any other implementation of normalization algorithms known to us. Keywords: normalization, integral closure, Groebner basis. |
|---|
