Algorithmic aspects of Suslin's proof of Serre's conjecture

Let F be a unimodular r×s matrix with entries being n-variate polynomials over an infinite field K. Denote by deg(F) the maximum of the degrees of the entries of F and let d=1+deg(F). We describe an algorithm which computes a unimodular s×s matrix M with deg(M)=(rd)O(n) such that FM=[Ir, O], where [...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 1993
Materias:
complexity
effective Nullstellensatz
linear equation systems over polynomial rings
Quillen-Suslin Theorem
Serre's Conjecture
Subject classifications: 68C25
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_10163328_v3_n1_p31_Caniglia
http://hdl.handle.net/20.500.12110/paper_10163328_v3_n1_p31_Caniglia
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares