On the computation of the radical of polynomial complete intersection ideals

This paper deals with the effective computation of the radical of certain polynomial ideals. Let k be a characteristic zero field, f1,…, fn−r ε k[X1,…, Xn] a regular sequence with d:=maxj deg fj, (Formula presented.) the generated ideal (Formula presented.) its radical, and suppose that the factor r...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Armendáriz, I., Solernó, P., Mora T., Cohen G., Giusti M.
Formato: SER
Materias:
Artificial intelligence
Computers
Cohen-Macaulay
Complete intersection
Exponential algorithms
Zero fields
Algebra
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03029743_v948_n_p106_Armendariz
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
Descripción
Sumario:This paper deals with the effective computation of the radical of certain polynomial ideals. Let k be a characteristic zero field, f1,…, fn−r ε k[X1,…, Xn] a regular sequence with d:=maxj deg fj, (Formula presented.) the generated ideal (Formula presented.) its radical, and suppose that the factor ring (Formula presented.) is a Cohen-Macaulay ring. Under these assumptions we exhibit a single exponential algorithm which computes a system of generators of (Formula presented.). © Springer-Verlag Berlin Heidelberg 1995.

Ejemplares similares