An algorithm for the computation of the radical of an ideal

We propose a new algorithm for the computation of the radical of an ideal in a polynomial ring. In recent years many algorithms have been proposed. A common technique used is to reduce the problem to the zero dimensional case. In the algorithm we present here, we use this reduction, but we avoid the...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Laplagne, Santiago Jorge
Publicado: 2006
Materias:
Algorithms
Complexity
Polynomial ideal
Primary decomposition
Radical
Computational complexity
Computational methods
Polynomial approximation
Problem solving
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15959327_v2006_n_p191_Laplagne
http://hdl.handle.net/20.500.12110/paper_15959327_v2006_n_p191_Laplagne
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paper:paper_15959327_v2006_n_p191_Laplagne
record_format dspace
spelling paper:paper_15959327_v2006_n_p191_Laplagne2023-06-08T16:24:55Z An algorithm for the computation of the radical of an ideal Laplagne, Santiago Jorge Algorithms Complexity Polynomial ideal Primary decomposition Radical Computational complexity Computational methods Polynomial approximation Problem solving Polynomial ideal Primary decomposition Radical Algorithms We propose a new algorithm for the computation of the radical of an ideal in a polynomial ring. In recent years many algorithms have been proposed. A common technique used is to reduce the problem to the zero dimensional case. In the algorithm we present here, we use this reduction, but we avoid the redundant components that appeared in other algorithms . As a result, our algorithm is in some cases more efficient. Copyright 2006 ACM. Fil:Laplagne, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2006 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15959327_v2006_n_p191_Laplagne http://hdl.handle.net/20.500.12110/paper_15959327_v2006_n_p191_Laplagne
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Algorithms
Complexity
Polynomial ideal
Primary decomposition
Radical
Computational complexity
Computational methods
Polynomial approximation
Problem solving
Polynomial ideal
Primary decomposition
Radical
Algorithms
spellingShingle Algorithms
Complexity
Polynomial ideal
Primary decomposition
Radical
Computational complexity
Computational methods
Polynomial approximation
Problem solving
Polynomial ideal
Primary decomposition
Radical
Algorithms
Laplagne, Santiago Jorge
An algorithm for the computation of the radical of an ideal
topic_facet Algorithms
Complexity
Polynomial ideal
Primary decomposition
Radical
Computational complexity
Computational methods
Polynomial approximation
Problem solving
Polynomial ideal
Primary decomposition
Radical
Algorithms
description We propose a new algorithm for the computation of the radical of an ideal in a polynomial ring. In recent years many algorithms have been proposed. A common technique used is to reduce the problem to the zero dimensional case. In the algorithm we present here, we use this reduction, but we avoid the redundant components that appeared in other algorithms . As a result, our algorithm is in some cases more efficient. Copyright 2006 ACM.
author Laplagne, Santiago Jorge
author_facet Laplagne, Santiago Jorge
author_sort Laplagne, Santiago Jorge
title An algorithm for the computation of the radical of an ideal
title_short An algorithm for the computation of the radical of an ideal
title_full An algorithm for the computation of the radical of an ideal
title_fullStr An algorithm for the computation of the radical of an ideal
title_full_unstemmed An algorithm for the computation of the radical of an ideal
title_sort algorithm for the computation of the radical of an ideal
publishDate 2006
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15959327_v2006_n_p191_Laplagne
http://hdl.handle.net/20.500.12110/paper_15959327_v2006_n_p191_Laplagne
work_keys_str_mv AT laplagnesantiagojorge analgorithmforthecomputationoftheradicalofanideal
AT laplagnesantiagojorge algorithmforthecomputationoftheradicalofanideal
_version_ 1768543627055726592

Ejemplares similares