ALGORITHMS FOR THE QUILLEN-SUSLIN THEOREM

被引：57

作者：

LOGAR, A ^{[1
]}

STURMFELS, B ^{[1
]}

机构：

[1] CORNELL UNIV,DEPT MATH,ITHACA,NY 14853

来源：

JOURNAL OF ALGEBRA | 1992年 / 145卷 / 01期

关键词：

D O I：

10.1016/0021-8693(92)90189-S

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We give an algorithm for computing a free basis of a projective C[x1,...xn,-module which is presented as the image, kernel, or cokernel of a polynomial matrix. Our method can be implemented using Gröbner bases, and it provides an elementary, constructive proof of the Quillen-Suslin theorem. © 1992.

引用

页码：231 / 239

页数：9

共 13 条

[1]

Bayer D., 1982, THESIS HARVARD U

[2]

BILLERA LJ, IN PRESS MATH Z

[3]

BUCHBERGER B, 1985, MULTIDIMENSIONAL SYS, pCH 6

[4]

FITCHAS N, 1988, ASPECTOS ALGORITMICO

[5]

FITCHAS N, 1989, SEMINAIRE STRUCTURES

[6]

Grobner W., 1970, HOCHSCHULTASCHENBUCG

[7]

KUNZ E, 1985, INTRO COMMUNATIVE AL

[8]

LAM TY, 1978, LECTURE NOTES MATH, V635

[9]

LOGA A, 1988, P AAECC, V357, P259

[10] COMPUTATIONAL ASPECTS OF THE COORDINATE RING OF AN ALGEBRAIC VARIETY [J].

LOGAR, A .

COMMUNICATIONS IN ALGEBRA, 1990, 18 (08) :2641-2662

← 1 2 →