论文信息 - On the Complexity of Computing Syzygies

On the Complexity of Computing Syzygies

We give a self-contained exposition of Mayr & Meyer's example of a polynomial ideal exhibiting double exponential degrees for the ideal membership problem, and generalise this example to exhibit minimal syzygies of double exponential degree. This demonstrates the existence of subschemes of projective space of double exponential regularity.

Michael Eugene Stillman | David Bayer | D. Bayer | M. Stillman

[1] A. Seidenberg. Constructions in algebra , 1974 .

[2] W. Brownawell. Bounds for the degrees in the Nullstellensatz , 1987 .

[3] H. Pinkham,et al. A Castelnuovo bound for smooth surfaces , 1986 .

[4] David Masser,et al. Fields of large transcendence degree generated by values of elliptic functions , 1983 .

[5] Bruno Buchberger,et al. A theoretical basis for the reduction of polynomials to canonical forms , 1976, SIGS.

[6] Grete Hermann,et al. Die Frage der endlich vielen Schritte in der Theorie der Polynomideale , 1926 .

[7] A. Meyer,et al. The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[8] David Eisenbud,et al. Linear Free Resolutions and Minimal Multiplicity , 1984 .

[9] Robert Lazarsfeld,et al. On a theorem of Castelnuovo, and the equations defining space curves , 1983 .