Computing bases of complete intersection rings in Noether position

Let k be an effective infinite perfect field, k[x1,...,xn] the polynomial ring in n variables and F∈k[x1,...,xn]M×M a square polynomial matrix verifying F2=F. Suppose that the entries of F are polynomials given by a straight-line program of size L and their total degrees are bounded by an integer D....

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2001
Materias:
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00224049_v162_n2-3_p127_Almeida
http://hdl.handle.net/20.500.12110/paper_00224049_v162_n2-3_p127_Almeida
Aporte de:

Ejemplares similares